Computer Science

What is the minimum height of complete binary tree?


Wiki User

A complete binary tree is "a binary tree in which evert level, except possibly the deepest, is completely filled. At depth n, the height of the tree, all nodes must be as far left as possible."

According the the above definition by the NIST, this means that the minimum height of a complete binary tree is 1.