Template:TreesFlagBase: Difference between revisions
From charlesreid1
No edit summary |
No edit summary |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 11: | Line 11: | ||
Series on [[Data Structures]] | Series on [[Data Structures]] | ||
[[Trees Study Guide]] | |||
| Line 17: | Line 19: | ||
Abstract data type: [[Trees/ADT]] | Abstract data type: [[Trees/ADT]] | ||
Concrete implementations: [[Trees/LinkedTree]] {{,}} [[ | Concrete implementations: [[Trees/LinkedTree]] {{,}} [[Binary Trees/ArrayBinTree|Trees/ArrayTree]] {{,}} [[SimpleTree]] | ||
<br /> | <br /> | ||
<br /> | <br /> | ||
'''Tree | '''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 operations: [[Trees/Operations Performance]] {{,}} [[Trees/Removal]] | ||
| Line 37: | Line 49: | ||
'''Tree Applications''' | '''Tree Applications''' | ||
[[Expression Trees]] | [[Expression Trees]] | ||
Finding Minimum in Log N Time: [[Tree/LogN Min Search]] | |||
<br /> | <br /> | ||
Latest revision as of 12:19, 7 September 2017
 |
Trees Part of Computer Science Notes
Series on Data Structures 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 Finding Minimum 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
|