Trees
A tree is a structure made of nodes connected like a family tree.
It starts from a top node called the root.
Files In This Folder
- Basic Tree Terminologies
- Binary Tree
- Threaded Binary Tree
- Binary Search Tree
- AVL Tree
- Applications Of Binary Trees
- B-Tree
- B+ Tree
- Comparison
- Visual Comparison
Fast Idea
| Tree | Main Idea |
|---|---|
| Binary Tree | Each node has at most 2 children |
| Threaded Binary Tree | Empty child links are used to help traversal |
| BST | Left smaller, right larger |
| AVL Tree | BST that keeps itself balanced |
| B-Tree | Multi-child balanced tree for disks/databases |
| B+ Tree | Like B-Tree, but data search is optimized in leaves |
See Also
For side-by-side notes, read Comparison.
For diagram-heavy notes, read Visual Comparison.