Template:TreesFlag: Difference between revisions
From charlesreid1
No edit summary |
No edit summary |
||
| Line 54: | Line 54: | ||
'''[[Binary Search Trees]]''' | '''[[Binary Search Trees]]''' | ||
<br /> | |||
<br /> | |||
'''[[Advanced Trees]]''' | |||
Types: [[AVL Trees]] {{,}} [[Splay Trees]] {{,}} [[2-4 Trees]] {{,}} [[Red Black Trees]] | |||
<br /> | |||
<br /> | |||
<small>[[Flags]]</small> {{,}} <small>[[Template:TreesFlag]]</small> {{,}} <small>[http://charlesreid1.com/w/index.php?title=Template:TreesFlag&action=edit e]</small> | <small>[[Flags]]</small> {{,}} <small>[[Template:TreesFlag]]</small> {{,}} <small>[http://charlesreid1.com/w/index.php?title=Template:TreesFlag&action=edit e]</small> | ||
Revision as of 21:38, 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 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
Types: AVL Trees · Splay Trees · 2-4 Trees · Red Black Trees
|