TreeNodespecialization with only two child nodes, left and right.A node in a directed graph (that may have cycles).General utility methods for operating on directed graphs (consisting of
GraphNodes).A simple immutable implementation of the
BinaryTreeNodeinterface.A simple, immutable
ImmutableGraphNodespecialization representing a tree node with a parent field linking back to the nodes (only) parent.A
TreeNodespecialiation that allow for mutability of the tree structure.A base implementation of the
MutableTreeNode.A specialization of a
GraphNodethat contains a reference to its parent, thereby making the graph a tree (since each node can now have only one parent node).General utility methods for operating on tree, i.e.