Doubly chained tree
In computer science, a doubly chained tree is a tree data structure in which each node has two pointers. Typically, each node has one pointer pointing to its child and one pointing at the node to its right. Then the following node will have one pointing to its child and one to its parent.
|This computer science article is a stub. You can help Wikipedia by expanding it.|