C++Talk.NET C++ language newsgroups   Archives   FAQ   Search   Memberlist   Usergroups   Register   Profile   Log in to check your private messages   Log in  Need an algorithm for creating an complete binary tree.          C++Talk.NET Forum Index -> C++ language (comp.lang.c++) View previous topic :: View next topic   Author Message C-man Guest Posted: Thu Mar 04, 2004 1:04 am    Post subject: Need an algorithm for creating an complete binary tree. Yeah, for some reason I can seem to find an algorithm that will simple but items into the tree in fashion such that a new leaf can't be added to a new level till all the leafs at the previous level are used. This would seem like an easy solution but I couldn't find one and I only could get it parsley working. Any body of a solution? Thanks Back to top Mike Wahler Guest Posted: Thu Mar 04, 2004 1:46 am    Post subject: Re: [OT, welcome msg, link] Need an algorithm for creating a "C-man" <iamcleaver (AT) shaw (DOT) ca> wrote Quote: Yeah, for some reason I can seem to find an algorithm that will simple but items into the tree in fashion such that a new leaf can't be added to a new level till all the leafs at the previous level are used. This would seem like an easy solution but I couldn't find one and I only could get it parsley working. Any body of a solution? Algorithms aren't topical here. Just the ISO standard C++ language. See: http://www.slack.net/~shiva/welcome.txt However: http://www.google.com/search?hl=en&ie=UTF-8&oe=UTF-8&q=%22binary+tree%22+alg orithm+%22C%2B%2B%22&btnG=Google+Search (that'll probably wrap, just paste it back together) Over 7,000 hits. You might want to try asking about this in an algorithms group or mailing list. -Mike Back to top Dietmar Kuehl Guest Posted: Thu Mar 04, 2004 9:09 am    Post subject: Re: Need an algorithm for creating an complete binary tree. "C-man" <iamcleaver (AT) shaw (DOT) ca> wrote: Quote: Yeah, for some reason I can seem to find an algorithm that will simple but items into the tree in fashion such that a new leaf can't be added to a new level till all the leafs at the previous level are used. This would seem like an easy solution but I couldn't find one and I only could get it parsley working. Any body of a solution? What is your actual goal? Typically, for something like a search tree it is sufficient that the tree is reasonably balanced. For example, if the maximum height in each (sub)tree is at most twice the minimum height, you will get logarithmic access to all operations. And the corresponding condition is relatively easy to maintain using AVL- or Red-Black-Trees. The simplest approach to a fully balanced binary tree is probably using an array in the first place! You would use 'std::lower_bound()' to locate a position - be it for insertion or lookup. The container is, in this case, of course not node bound. -- <mailto:dietmar_kuehl (AT) yahoo (DOT) com> <http://www.dietmar-kuehl.de/> Phaidros eaSE - Easy Software Engineering: <http://www.phaidros.com/> Back to top Display posts from previous: All Posts1 Day7 Days2 Weeks1 Month3 Months6 Months1 Year Oldest FirstNewest First         C++Talk.NET Forum Index -> C++ language (comp.lang.c++) All times are GMT Page 1 of 1   Jump to: Select a forum C/C++----------------C LanguageC Language (Moderated)C++ Language (Moderated)C++ language (comp.lang.c++)C++ language, library and standards Non-English C/C++ Newsgroups----------------C++ (German)C++ (French)  You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot vote in polls in this forum Powered by phpBB © 2001, 2006 phpBB Group SEO toolkit © 2004-2006 webmedic.