Template:TreesFlag: Difference between revisions

From charlesreid1

No edit summary
(Replaced content with "{{TreesFlagBase}} Category:Trees")
 
(5 intermediate revisions by the same user not shown)
Line 1: Line 1:
[[Category:CS]]
{{TreesFlagBase}}
[[Category:Data Structures]]


{{Flag
|header=Trees (Flag)
|image=CSFlag.jpg
|text=


<br />
[[Category:Trees]]
<br />
 
'''[[Trees]]'''
 
Abstract data type: [[Trees/ADT]]
 
Concrete implementations: [[Trees/LinkedTree]] {{,}} [[Trees/ArrayTree]]
 
[[SimpleTree]]
 
<br />
<br />
 
'''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]]
 
<br />
<br />
 
'''Tree Applications'''
 
[[Expression Trees]] {{,}} (Skiena Ch 3) Find Min in Log N Time: [[Tree/LogN Min Search]]
 
<br />
<br />
 
'''[[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]]
 
<br />
<br />
 
'''[[Binary Search Trees]]'''
 
Abstract data type: [[Binary Search Trees/ADT]]
 
Implementation: [[Java/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>
}}
 
<br />

Latest revision as of 04:00, 22 June 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:TreesFlag&oldid=18615"