From charlesreid1

(Linked tree class)
m (Replacing charlesreid1.com:3000 with git.charlesreid1.com)
 
Line 5: Line 5:
 
==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:3000/cs/java/src/master/trees/LinkedBinTree.java
+
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