| Trees Part of Computer Science Notes
Trees
Abstract data type: Trees/ADT
Concrete implementations: Trees/LinkedTree · Trees/ArrayTree · SimpleTree
Tree Algorithms
Traversal algorithms: Trees/Preorder · Binary Trees/Inorder · Trees/Postorder
More Traversal Algorithms: BFS (Breadth-first search) and BFT (Breadth-first traversal) · DFS (depth first search) and DFT (Depth-first traversal)
Trees/OOP · Tree Traversal/OOP · Tree Traversal/Template Method Pattern
Tree operations: Trees/Operations Performance · Trees/Removal
Tree Applications
Expression Trees · (Skiena Ch 3) Find Min in Log N Time: Tree/LogN Min Search
Binary Trees
Abstract data type: Binary Trees/ADT
Concrete implementations: Binary Trees/LinkedBinTree · Binary Trees/ArrayBinTree
Binary Trees/Cheat Sheet · Binary Trees/OOP · Binary Trees/Implementation Notes
Binary Search Trees
Abstract data type: Binary Search Trees/ADT
Implementation: Java/Binary Search Trees
Heaps
(Note that heaps are also value-sorting trees with minimums at the top. See Template:PriorityQueuesFlag and Priority Queues.)
Advanced Trees
Types: AVL Trees · Splay Trees · 2-4 Trees · Red Black Trees
Flags · Template:TreesFlagBase · e |
