Template:TreesFlag: Difference between revisions
From charlesreid1
No edit summary |
No edit summary |
||
| Line 19: | Line 19: | ||
[[BFS]] (Breadth-first search) and [[BFT]] (Breadth-first traversal) {{,}} [[DFS]] (depth first search) and [[DFT]] (Depth-first traversal) | [[BFS]] (Breadth-first search) and [[BFT]] (Breadth-first traversal) {{,}} [[DFS]] (depth first search) and [[DFT]] (Depth-first traversal) | ||
Applications of Trees: [[Postfix Expressions#Trees]] {{,}} Skiena Ch 3 | Applications of Trees: [[Postfix Expressions#Trees]] {{,}} (Skiena Ch 3) Find Min in Log N Time: [[Tree/LogN Min Search]] | ||
Revision as of 12:26, 12 June 2017
 |
Trees Trees
Abstract data type: Trees/ADT Concrete implementations: Trees/LinkedTree · Trees/ArrayTree Tree traversal algorithms: Trees/Preorder · Binary Trees/Inorder · Trees/Postorder · Tree Traversal/OOP · Tree Traversal/Template Method Pattern Tree operations: Trees/Operations Performance · Trees/Removal BFS (Breadth-first search) and BFT (Breadth-first traversal) · DFS (depth first search) and DFT (Depth-first traversal) Applications of Trees: Postfix Expressions#Trees · (Skiena Ch 3) Find Min in Log N Time: Tree/LogN Min Search 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
|