BinarySearchTree.Node

Implements a single tree node.

struct BinarySearchTree(K, E)

struct Node {

this(K key, E elem, Node* left, Node* right);

int opApply(int delegate(Node) @(nogc) dg);

int opCmp(Node rhs);

size_t height [@property getter];

sizediff_t bal [@property getter];

void dealloc();

string toString();

}

Constructors

this this(K key, E elem, Node* left, Node* right): Undocumented in source.

Members

Functions

dealloc void dealloc(): Deallocates the memory allocated for the tree.
opApply int opApply(int delegate(Node) @(nogc) dg): Undocumented in source. Be warned that the author may not have intended to support it.
opCmp int opCmp(Node rhs): Undocumented in source. Be warned that the author may not have intended to support it.
toString string toString(): String representation for debugging.

Properties

bal sizediff_t bal [@property getter]: Returns the balance of the node. Minus if LHS is heavier, plus if RHS is heavier.
height size_t height [@property getter]: Returns the total height.

Variables

elem E elem;: Stores the element referred by this node
key K key;: Indentifier key, also used for automatic sorting
left Node* left;: lesser elements
right Node* right;: greater elements

Meta

Source

See Implementation