| Trees Part of Computer Science Notes
Series on Data Structures
Trees Study Guide
Trees
Abstract data type: Trees/ADT
Concrete implementations: Trees/LinkedTree · Trees/ArrayTree · SimpleTree
Tree Traversal
Preorder traversal: Trees/Preorder
Postorder traversal: Trees/Postorder
In-Order traversal: Binary Trees/Inorder
Breadth-First Search: BFS
Breadth-First Traversal: BFT
Depth-First Search: DFS
Depth-First Traversal: DFT
OOP Principles for Traversal: Tree Traversal/OOP · Tree Traversal/Traversal Method Template
Tree operations: Trees/Operations Performance · Trees/Removal
Tree Applications
Expression Trees
Finding Minimum 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
Flags · Template:TreesFlagBase · e |