Template:TreesFlagBase: Difference between revisions

From charlesreid1

No edit summary
No edit summary
Line 47: Line 47:


[[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]]'''
Abstract data type: [[Binary Search Trees/ADT]]
Implementation: [[Java/Binary Search Trees]]
<br />
<br />
'''[[Heaps]]'''
(Note that heaps are also value-sorting trees with minimums at the top. See [[Template:PriorityQueuesFlag]] and [[Priority Queues]].)
<br />
<br />
'''[[Advanced Trees]]'''
Types: [[AVL Trees]] {{,}} [[Splay Trees]] {{,}} [[2-4 Trees]] {{,}} [[Red Black Trees]]


<br />
<br />

Revision as of 04:50, 2 July 2017



CSFlag.jpg
Trees
Part of Computer Science Notes


Trees

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



Binary Trees

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



Flags  · Template:TreesFlagBase  · e



Retrieved from "https://charlesreid1.com/w/index.php?title=Template:TreesFlagBase&oldid=18995"