Trees/LinkedTree: Difference between revisions
From charlesreid1
No edit summary |
|||
| Line 7: | Line 7: | ||
==Flags== | ==Flags== | ||
{{ | {{TreesFlag}} | ||
[[Category:Trees]] | [[Category:Trees]] | ||
Revision as of 01:32, 11 June 2017
Linked tree class
A more generic version of the linked binary tree implementation LinkedBinTree (link: Binary Trees/LinkedBinTree)
This is a concrete implementation (making a decision about the low-level details of how the object will be arranged in memory) of the Tree ADT (see Trees/ADT).
Flags
 |
Trees Part of Computer Science Notes
Series on Data Structures 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 Finding Minimum 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
|