Template:TreesFlag: Difference between revisions
From charlesreid1
No edit summary |
No edit summary |
||
| Line 63: | Line 63: | ||
'''[[Heaps]]''' | '''[[Heaps]]''' | ||
Heaps are implemented as value-sorting trees with minimum at top. | Heaps are implemented as value-sorting trees with minimum at top. | ||
[[Priority Queues]] are implemented using [[Heaps]]. | |||
[[Heaps]] are [[Binary Trees]] useful for sorting. | |||
<br /> | <br /> | ||
Revision as of 03:39, 18 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
Abstract data type: Binary Search Trees/ADT Implementation: Java/Binary Search Trees
Heaps are implemented as value-sorting trees with minimum at top. Priority Queues are implemented using Heaps. Heaps are Binary Trees useful for sorting.
Types: AVL Trees · Splay Trees · 2-4 Trees · Red Black Trees
|