Name
Abstract | ||
|---|---|---|
A binary tree is an excellent structure for storing sorted data. Searching is optimum if the tree is balanced. The following algorithm was developed with the help of some background information. This algorithm has proven to be an effective method of inserting data into a tree while dynamically rebalancing the tree when necessary. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1145/100348.100469 | ACM Conference on Computer Science |
Keywords | Field | DocType |
excellent structure,binary tree,effective method,background information,following algorithm | Tree traversal,AVL tree,Computer science,K-ary tree,Binary tree,Algorithm,Theoretical computer science,Left-child right-sibling binary tree,Segment tree,Fractal tree index,Interval tree,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-89791-348-5 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew T. Cable | 1 | 0 | 0.34 |
| Domenick J. Pinto | 2 | 0 | 2.70 |