Trees/LinkedTree

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.

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).

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