Indexing with Binary Search Trees
T E R M S
- binary tree
- A tree in which each node has at most two children.
- leaf
- A node at the lowest level of a tree.
- height-balanced tree
- A tree in which the difference between the heights of subtrees in limited.
- Binary trees grow from the top down: new nodes are added as new leaves.
- Binary trees become unbalanced as new nodes are added.
- The imbalance of a binary tree depends on the order in which nodes are added and deleted.
- Worst case search with a balanced binary tree is log2 (N + 1) compares.
- Worst case search with an unbalanced binary tree is >N compares.
-Tree Methods: Search, Insert, and Others
Searching
Insertion
Create, Open, and Close
Example of Creating a B-Tree
No comments:
Post a Comment