What is the best algorithm to use in creating binary trees??

Posted by Hanseh on Stack Overflow See other posts from Stack Overflow or by Hanseh
Published on 2010-04-14T13:41:00Z Indexed on 2010/04/14 13:43 UTC
Read the original article Hit count: 363

Filed under:

binary-trees

|

algorithm-design

I've been doing a research about the best algorithm to use in creating a binary tree implementation. THe top entry in my list is nested sets. Are there any other alternative or better algorithm??

© Stack Overflow or respective owner

Related posts about binary-trees

Binary Trees in Scheme

as seen on Stack Overflow - Search for 'Stack Overflow'
Consider the following BNF defining trees of numbers. Notice that a tree can either be a leaf, a node-1 with one subtrees, or a node-2 with two subtrees. tree ::= (’leaf number) | (’node-1 tree) | (’node-2 tree tree) a. Write a template for recursive procedures on these trees. b. Define the procedure… >>> More
C++ design question on traversing binary trees

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a binary tree T which I would like to copy to another tree. Suppose I have a visit method that gets evaluated at every node: struct visit { virtual void operator() (node* n)=0; }; and I have a visitor algorithm void visitor(node* t, visit& v) { //do a preorder traversal using… >>> More
Priority queues and Binary trees

as seen on Stack Overflow - Search for 'Stack Overflow'
Trying to create a game using priority queues and binary tree, for example a solitaire game. I hope this is not to vague? >>> More
What are the applications of binary trees?

as seen on Stack Overflow - Search for 'Stack Overflow'
I am wondering what the particular applications of binary trees are. Could you give some real examples? Thanks. >>> More
A deque based on binary trees

as seen on Programmers - Search for 'Programmers'
This is a simple immutable deque based on binary trees. What do you think about it? Does this kind of data structure, or possibly an improvement thereof, seem useful? How could I improve it, preferably without getting rid of its strengths? (Not in the sense of more operations, in the sense of different… >>> More

Related posts about algorithm-design

Solutions for exercises in The Algorithm Design Manual

as seen on Stack Overflow - Search for 'Stack Overflow'
Does anybody know where to find solutions for the exercises in the book The Algorithm Design Manual? >>> More
Algorithm design, "randomising" timetable schedule in Python although open to other languages.

as seen on Stack Overflow - Search for 'Stack Overflow'
Before I start I should add I am a musician and not a native programmer, this was undertook to make my life easier. Here is the situation, at work I'm given a new csv file each which contains a list of sound files, their length, and the minimum total amount of time they must be played. I create… >>> More
Algorithm for dynamic combinations

as seen on Stack Overflow - Search for 'Stack Overflow'
My code has a list called INPUTS, that contains a dynamic number of lists, let's call them A, B, C, .. N. These lists contain a dynamic number of Events I would like to call a function with each combination of Events. To illustrate with an example: INPUTS: A(0,1,2), B(0,1), C(0,1,2,3) I need to… >>> More
Disk Search / Sort Algorithm

as seen on Stack Overflow - Search for 'Stack Overflow'
Given a Range of numbers say 1 to 10,000, Input is in random order. Constraint: At any point only 1000 numbers can be loaded to memory. Assumption: Assuming unique numbers. I propose the following efficient , "When-Required-sort Algorithm". We write the numbers into files which are designated… >>> More
how to tackle this combinatorial algorithm problem

as seen on Stack Overflow - Search for 'Stack Overflow'
I have N people who must each take T exams. Each exam takes "some" time, e.g. 30 min (no such thing as finishing early). Exams must be performed in front of an examiner. I need to schedule each person to take each exam in front of an examiner within an overall time period, using the minimum number… >>> More