Template:TreesFlag: Difference between revisions
From charlesreid1
No edit summary |
No edit summary |
||
| Line 13: | Line 13: | ||
Concrete implementations: [[Trees/LinkedTree]] {{,}} [[Trees/ArrayTree]] | Concrete implementations: [[Trees/LinkedTree]] {{,}} [[Trees/ArrayTree]] | ||
Tree traversal algorithms: [[Preorder]] {{,}} [[Inorder]] {{,}} [[Postorder]] {{,}} | Tree traversal algorithms: [[Preorder]] -> [[Trees/Preorder]] {{,}} [[Inorder]] -> [[Binary Trees/Inorder]] {{,}} [[Postorder]] -> [[Trees/Postorder]] {{,}} [[Tree Traversal/OOP]] {{,}} [[Tree Traversal/Template Method Pattern]] | ||
[[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 question: [[Tree/LogN Min Search]] | Applications of Trees: [[Postfix Expressions#Trees]] {{,}} Skiena Ch 3 question: [[Tree/LogN Min Search]] | ||
Revision as of 19:18, 11 June 2017
 |
Trees Trees
Abstract data type: Trees/ADT Concrete implementations: Trees/LinkedTree · Trees/ArrayTree Tree traversal algorithms: Preorder -> Trees/Preorder · Inorder -> Binary Trees/Inorder · Postorder -> Trees/Postorder · Tree Traversal/OOP · Tree Traversal/Template Method Pattern 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 question: 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
|