Trees/LinkedTree: Difference between revisions
From charlesreid1
No edit summary |
m (Replacing charlesreid1.com:3000 with git.charlesreid1.com) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 2: | Line 2: | ||
Any tree structure can be implemented using a linked memory structure - the nodes of the tree simply become objects that live in memory, and the tree structure becomes a collection of links, similar to a linked list. | Any tree structure can be implemented using a linked memory structure - the nodes of the tree simply become objects that live in memory, and the tree structure becomes a collection of links, similar to a linked list. | ||
==Java implementation - linked binary tree== | ==Java implementation - linked binary tree== | ||
A concrete implementation (in Java) of a binary tree using a link structure for memory is at [[Binary Trees/LinkedBinTree]] - link: https://charlesreid1.com | A concrete implementation (in Java) of a binary tree using a link structure for memory is at [[Binary Trees/LinkedBinTree]] - link: https://git.charlesreid1.com/cs/java/src/master/trees/LinkedBinTree.java | ||
==Flags== | ==Flags== | ||
Latest revision as of 03:58, 9 October 2019
Trees are directed acyclic graphs.
Any tree structure can be implemented using a linked memory structure - the nodes of the tree simply become objects that live in memory, and the tree structure becomes a collection of links, similar to a linked list.
Java implementation - linked binary tree
A concrete implementation (in Java) of a binary tree using a link structure for memory is at Binary Trees/LinkedBinTree - link: https://git.charlesreid1.com/cs/java/src/master/trees/LinkedBinTree.java
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
|