Doubly chained tree

From Wikipedia, the free encyclopedia

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.

External links

Information Retrieval

v t e Tree data structures

Binary trees	Binary search tree (BST) Cartesian tree MVP Tree Top tree T-tree Left-child right-sibling binary tree

Self-balancing binary search trees	AA tree AVL tree LLRB tree Red–black tree Scapegoat tree Splay tree Treap

B-trees	B+ tree B*-tree B^x-tree UB-tree 2–3 tree 2–3–4 tree (a,b)-tree Dancing tree HTree

Tries	Suffix tree Radix tree Hash tree Ternary search tree X-fast trie Y-fast trie

Binary space partitioning (BSP) trees	Quadtree Octree k-d tree Implicit k-d tree VP tree

Non-binary trees	Exponential tree Fusion tree Interval tree PQ tree Range tree SPQR tree Van Emde Boas tree

Spatial data partitioning trees	R-tree R+ tree R* tree X-tree M-tree Segment tree Hilbert R-tree Priority R-tree

Other trees	Heap Hash calendar Merkle tree Finger tree Order statistic tree Metric tree Cover tree BK-tree Doubly chained tree iDistance Link/cut tree Fenwick tree Log-structured merge-tree

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.