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]] | ||
Applications of Trees: [[ | Tree traversal algorithms: [[Preorder]] {{,}} [[Inorder]] {{,}} [[Postorder]] {{,}} [[BFS]] (Breadth-first search) and [[BFT]] (Breadth-first traversal) {{,}} [[DFS]] (depth first search) and [[DFT]] (Depth-first traversal) | ||
[[Tree Traversal/OOP]] {{,}} [[Tree Traversal/Template Method Pattern]] | |||
Applications of Trees: [[Postfix Expressions#Trees]] {{,}} Skiena Ch 3 question: [[Tree/LogN Min Search]] | |||
| Line 22: | Line 26: | ||
Concrete implementations: [[Binary Trees/LinkedBinTree]] {{,}} [[Binary Trees/ArrayBinTree]] | Concrete implementations: [[Binary Trees/LinkedBinTree]] {{,}} [[Binary Trees/ArrayBinTree]] | ||
[[Binary Trees/Cheat Sheet]] {{,}} [[Binary Trees/ | [[Binary Trees/Cheat Sheet]] {{,}} [[Binary Trees/OOP]] {{,}} [[Binary Trees/Implementation Notes]] | ||
[[Binary Search Trees]] | [[Binary Search Trees]] | ||
Revision as of 19:16, 11 June 2017
 |
Trees Trees
Abstract data type: Trees/ADT Concrete implementations: Trees/LinkedTree · Trees/ArrayTree Tree traversal algorithms: Preorder · Inorder · Postorder · BFS (Breadth-first search) and BFT (Breadth-first traversal) · DFS (depth first search) and DFT (Depth-first traversal) Tree Traversal/OOP · Tree Traversal/Template Method Pattern 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
|