Template:TreesFlagBase: Difference between revisions
From charlesreid1
(Created page with "Category:CS Category:Data Structures {{Flag |header=Trees |image=CSFlag.jpg |text= <br /> <br /> '''Trees''' Abstract data type: Trees/ADT Concrete implem...") |
No edit summary |
||
| Line 7: | Line 7: | ||
|text= | |text= | ||
Part of [[CS|Computer Science Notes]] | |||
'''[[Trees]]''' | '''[[Trees]]''' | ||
| Line 14: | Line 15: | ||
Abstract data type: [[Trees/ADT]] | Abstract data type: [[Trees/ADT]] | ||
Concrete implementations: [[Trees/LinkedTree]] {{,}} [[Trees/ArrayTree]] | Concrete implementations: [[Trees/LinkedTree]] {{,}} [[Trees/ArrayTree]] {{,}} [[SimpleTree]] | ||
[[SimpleTree]] | |||
<br /> | <br /> | ||
Revision as of 05:31, 22 June 2017
 |
Trees Part of Computer Science Notes
Abstract data type: Trees/ADT Concrete implementations: Trees/LinkedTree · Trees/ArrayTree · SimpleTree
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) Trees/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
|