TOPICS
Search

Complete Binary Tree

CompleteBinaryTree

A labeled binary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2 and 3, branches from these leading to 4, 5 and 6, 7, respectively, and so on (Knuth 1997, p. 401). The graph corresponding to the complete binary tree on n nodes is implemented in the Wolfram Language as KaryTree[n, 2].

See also

Binary Tree, Complete Tree, Complete Ternary Tree, Heap

Explore with Wolfram|Alpha

References

Knuth, D. E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 3rd ed. Reading, MA: Addison-Wesley, 1997.Knuth, D. E. The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed. Reading, MA: Addison-Wesley, p. 144, 1998.

Referenced on Wolfram|Alpha

Complete Binary Tree

Cite this as:

Weisstein, Eric W. "Complete Binary Tree." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/CompleteBinaryTree.html

Subject classifications