interval_tree v0.1.0 Interval.Node
Node serves as the building block for the interval tree
Tracks the max interval high value for the subtree rooted at this node
Stores interval in data field. Stores left and right children as well.
We keep track of the height of subtrees for AVL balancing
Not too much different than the C counterpart (https://bitbucket.org/brpandey/c-data-structures/src)
struct Node { int max; int height; struct Interval data; struct Node left; struct Node right; };
Link to this section Summary
Functions
Provides dump of node info to be used in Inspect protocol implementation
Link to this section Functions
Link to this function
info(node)
Provides dump of node info to be used in Inspect protocol implementation