Template:TreesFlag: Difference between revisions
From charlesreid1
No edit summary |
No edit summary |
||
| Line 3: | Line 3: | ||
{{Flag | {{Flag | ||
|header=Trees | |header=Trees (Flag) | ||
|image=CSFlag.jpg | |image=CSFlag.jpg | ||
|text= | |text= | ||
<br /> | |||
<br /> | |||
[[Trees]] | '''[[Trees]]''' | ||
Abstract data type: [[Trees/ADT]] | Abstract data type: [[Trees/ADT]] | ||
| Line 16: | Line 17: | ||
[[SimpleTree]] | [[SimpleTree]] | ||
<br /> | |||
<br /> | |||
'''Tree Algorithms''' | '''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) | |||
[[ | Tree OOP: [[Tree Traversal/OOP]] {{,}} [[Tree Traversal/Template Method Pattern]] | ||
Tree operations: [[Trees/Operations Performance]] {{,}} [[Trees/Removal]] | Tree operations: [[Trees/Operations Performance]] {{,}} [[Trees/Removal]] | ||
<br /> | |||
<br /> | |||
'''Tree Applications''' | '''Tree Applications''' | ||
| Line 29: | Line 38: | ||
Applications: [[Expression Trees]] {{,}} (Skiena Ch 3) Find Min in Log N Time: [[Tree/LogN Min Search]] | Applications: [[Expression Trees]] {{,}} (Skiena Ch 3) Find Min in Log N Time: [[Tree/LogN Min Search]] | ||
<br /> | |||
<br /> | |||
''' | '''[[Binary Trees]]''' | ||
[[Binary Trees]] | |||
Abstract data type: [[Binary Trees/ADT]] | Abstract data type: [[Binary Trees/ADT]] | ||
| Line 40: | Line 49: | ||
[[Binary Trees/Cheat Sheet]] {{,}} [[Binary Trees/OOP]] {{,}} [[Binary Trees/Implementation Notes]] | [[Binary Trees/Cheat Sheet]] {{,}} [[Binary Trees/OOP]] {{,}} [[Binary Trees/Implementation Notes]] | ||
<br /> | |||
<br /> | |||
'''[[Binary Search Trees]]''' | |||
[[Binary Search Trees]] | |||
Revision as of 21:36, 17 June 2017
 |
Trees (Flag)
Abstract data type: Trees/ADT Concrete implementations: Trees/LinkedTree · Trees/ArrayTree
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) Tree OOP: Tree Traversal/OOP · Tree Traversal/Template Method Pattern Tree operations: Trees/Operations Performance · Trees/Removal
Tree Applications Applications: Expression 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
|