#id_tree
A library for creating and modifying Tree structures.
Overview
In this implementation, the Tree owns all of the Nodes and all inter-Node relationships are
managed with NodeIds.
Trees in this library are "just" trees. They do not allow cycles. They do not allow
the creation of arbitrary Graph structures. There is no weight associated with edges between
Nodes. In addition, each Node can have an arbitrary number of child Nodes.
It is important to note that this library does not support comparison-based Node insertion.
In other words, this is not a Binary Search Tree (or any other kind of search tree) library.
It is purely a library for storing data in a hierarchical manner. The caller must know the
structure that they wish to build and then use this library to do so; this library will not
make those structural decisions for you.
Project Goals
- Allow caller control of as many allocations as possible (through pre-allocation)
- Fast
Nodeinsertion and removal - Arbitrary Tree structure creation and manipulation
Non-Goals
- Arbitrary Graph structure creation and manipulation
- Comparison-based node insertion of any kind