Template:TreesFlagBase: Difference between revisions

From charlesreid1

No edit summary
No edit summary
 
(8 intermediate revisions by the same user not shown)
Line 9: Line 9:
Part of [[CS|Computer Science Notes]]
Part of [[CS|Computer Science Notes]]


Series on [[Data Structures]]
[[Trees Study Guide]]




Line 15: Line 19:
Abstract data type: [[Trees/ADT]]
Abstract data type: [[Trees/ADT]]


Concrete implementations: [[Trees/LinkedTree]] {{,}} [[Trees/ArrayTree]] {{,}} [[SimpleTree]]
Concrete implementations: [[Trees/LinkedTree]] {{,}} [[Binary Trees/ArrayBinTree|Trees/ArrayTree]] {{,}} [[SimpleTree]]


<br />
<br />
<br />
<br />


'''Tree Algorithms'''
'''Tree Traversal'''
 
Preorder traversal: [[Trees/Preorder]]
 
Postorder traversal: [[Trees/Postorder]]
 
In-Order traversal: [[Binary Trees/Inorder]]
 
Breadth-First Search: [[BFS]]
 
Breadth-First Traversal: [[BFT]]


Traversal algorithms: [[Trees/Preorder]] {{,}} [[Binary Trees/Inorder]] {{,}} [[Trees/Postorder]]
Depth-First Search: [[DFS]]


More Traversal Algorithms: [[BFS]] (Breadth-first search) and [[BFT]] (Breadth-first traversal) {{,}} [[DFS]] (depth first search) and [[DFT]] (Depth-first traversal)
Depth-First Traversal: [[DFT]]


[[Trees/OOP]] {{,}} [[Tree Traversal/OOP]] {{,}} [[Tree Traversal/Template Method Pattern]]
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 35: Line 49:
'''Tree Applications'''
'''Tree Applications'''


[[Expression Trees]] {{,}} (Skiena Ch 3) Find Min in Log N Time: [[Tree/LogN Min Search]]
[[Expression Trees]]
 
Finding Minimum in Log N Time: [[Tree/LogN Min Search]]


<br />
<br />
Line 47: Line 63:


[[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:StacksQueues]] and [[Priority Queues]].)
<br />
<br />
'''[[Advanced Trees]]'''
Types: [[AVL Trees]] {{,}} [[Splay Trees]] {{,}} [[2-4 Trees]] {{,}} [[Red Black Trees]]


<br />
<br />

Latest revision as of 12:19, 7 September 2017



CSFlag.jpg
Trees
Part of Computer Science Notes

Series on Data Structures


Trees Study Guide


Trees

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

Expression Trees

Finding Minimum 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=20949"