e/Doubly-chained tree

Information
has gloss	eng: 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.
lexicalization	eng: Doubly-chained tree
instance of	e/Tree (data structure)