## Answer

###### Wiki User

###### 07/25/2009

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.

## Related Questions

###### Asked in Computer Programming, Database Programming, C Programming

### Minimum number of nodes in a binary tree whose height is h?

Minimum is h nodes
(Maximum is 2h+1 - 1 nodes, if tree consisting of only one node
is considered to have height of 0. if you consider a tree with one
node to be a height of one, then the minimum nodes is (2^(h-1)) 1
nodes.
Minimum number of nodes in a binary tree of height is 2h+1.
For example, if the height of the binary tree is 3, minimum
number of nodes is
2*3+1=7.
...

Read More

###### Asked in C Programming

### What is the height of a complete binary tree of height h have?

You've already answered your own question: it's h.

Read More

###### Asked in Computer Programming, Database Programming, C Programming

### What is complete binary tree in c?

A complete binary tree is a binary tree where every node other
than the leaves has two children.
...

Read More

###### Asked in C Programming

### What is the maximum height of a Binary search tree with n nodes?

Maximum height of Binary Search Tree of nodes is n-1

Read More

###### Asked in Computer Terminology, Database Programming

### What is an almost complete binary tree?

An almost complete binary tree is a tree in which each node that
has a right child also has a left child. Having a left child does
not require a node to have a right child. Stated alternately, an
almost complete binary tree is a tree where for a right child,
there is always a left child, but for a left child there may not be
a right child.The number of nodes in a binary tree can be found
using this...

Read More

###### Asked in C Programming

### Type of binary tree?

A binary tree is type of tree with finite number of elements and
is divided into three main parts. the first part is called root of
the tree and itself binary tree which exists towards left and right
of the tree. There are a no. of binary trees and these are as
follows : 1) rooted binary tree 2) full binary tree 3) perfect
binary tree 4) complete binary tree 5) balanced binary tree 6)
rooted complete binary tree
...

Read More

###### Asked in Computers

### How many types of binary tree?

A binary tree is type of tree with finite number of elements and
is divided into three main parts. the first part is called root of
the tree and itself binary tree which exists towards left and right
of the tree. There are a no. of binary trees and these are as
follows : 1) rooted binary tree 2) full binary tree 3) perfect
binary tree 4) complete binary tree 5) balanced binary tree 6)
rooted complete binary tree
...

Read More

###### Asked in Computer Programming, Database Programming, C Programming

### Minimum and maximum height of a binary tree whose number of nodes is n?

For the height `h' of a binary tree, for which no further
attributes are given than the number `n' of nodes, holds:
ceil( ld n) <= h <= n
Where `ld' is the binary logarithm and `ceil' is rounding up to the
next integer.
...

Read More

###### Asked in Trees, C Programming

### Differentiate Complete binary tree vs full binary tree?

Full binary tree: every node other than the leaves all have 2
children
Complete binary tree: Full binary tree with all leaves on at
most two adjacent levels.
...

Read More

###### Asked in Computer Terminology, Computer Programming, Database Programming, C Programming

### What is the difference between a binary tree and a complete binary tree?

BINARY TREE ISN'T NECESSARY THAT ALL OF LEAF NODE IN SAME LEVEL
BUT COMPLETE BINARY TREE MUST HAVE ALL LEAF NODE IN SAME LEVEL.
Answer
Types of binary trees
A rooted binary tree is a rooted tree in which every node
has at most two children.
A full binary tree, or proper binary tree, is a tree in
which every node has zero or two children.
A perfect binary tree (sometimes complete binary tree) is
a full binary tree in which all leaves are...

Read More

###### Asked in Computer Programming, C Programming

### What are the properties of binary tree?

A binary tree of n elements has n-1 edges
A binary tree of height h has at least h and at most 2h - 1
elements
The height of a binary tree with n elements is at most n and at
least ?log2 (n+1)?
...

Read More

###### Asked in Database Programming

### Definition of almost complete binary tree?

A complete binary tree is a binary tree in which every
level, except possibly the last, is completely filled, and
all nodes are as far left as possible.
...

Read More

###### Asked in Education

### What is the difference between strictly binary tree and complete binary tree?

Complete Binary tree:
-All leaf nodes are found at the tree depth level
-All nodes(non-leaf) have two children
Strictly Binary tree:
-Nodes can have 0 or 2 children
...

Read More

###### Asked in The Difference Between

### What is the difference between extended binary tree and complete binary tree?

Complete Binary tree: All leaf nodes are found at the tree depth
level and All non-leaf nodes have two children.
Extended Binary tree: Nodes can have either 0 or 2 children.
...

Read More

###### Asked in Computer Programming, Database Programming, C Programming

### What is the minimum number of nodes in a binary tree of depth k?

if u assign a 0th level to root of binary tree then,the minimum
no. of nodes for depth K is k+1.
...

Read More

###### Asked in Computer Programming

### Difference between almost complete binary tree and complete binary tree?

A complete binary tree may also be defined as a full binary
tree in which all leaves are at depth n or (n-1) for some n. In
order for a tree to be the latter kind of complete binary tree, all
the children on the last level must occupy the leftmost spots
consecutively, with no spot left unoccupied in between any two. For
example, if two nodes on the bottommost level each occupy a spot
with an empty spot between the...

Read More

###### Asked in DIY Projects, How To

### How to find height of subtree in a Binary tree?

Check this out!
http://stackoverflow.com/questions/575772/the-best-way-to-calculate-the-height-in-a-binary-search-tree-balancing-an-avl
...

Read More

###### Asked in C Programming

### What is an algorithm that computes the height of a Binary tree?

Because a binary trees height has nothing to do with the number
of items in the tree you will have to find the longest branch by
walking the tree node by node.
When you get into the real world a "B tree" is used, if you get
to these you will like them over binary (red/black) trees.
...

Read More

###### Asked in Height

### What is the height of binary search tree in worst case?

In the worst case a binary search tree is linear and has a
height equal to the number of nodes. so h=O(h).
...

Read More

###### Asked in Computer Terminology, Database Programming

### Differentiate complete and full binary trees?

BINARY TREE ISN'T NECESSARY THAT ALL OF LEAF NODE IN SAME LEVEL
BUT COMPLETE BINARY TREE MUST HAVE ALL LEAF NODE IN SAME LEVEL.
A complete binary tree may also be defined as a full binary
tree in which all leaves are at depth n or n-1 for some n. In order
for a tree to be the latter kind of complete binary tree, all the
children on the last level must occupy the leftmost spots
consecutively, with no spot left...

Read More

###### Asked in Global Positioning Systems (GPS), Database Programming

### Advantages and disadvantages of binary tree?

1) the complexity of insertion,deletion and searching operation
is depend on the height of the tree.
i.e. if height is n(for skew binary tree) then complexity is
O(n) .
2) difficult to get the sorted list from the binary tree.which
is easy for BST.
...

Read More

###### Asked in Database Programming

### What is complexity of binary search tree?

The complexity of binary search tree :
Search , Insertion and Deletion is O(h) . and the Height can be
of O(n) ( if the tree is a skew tree).
For Balanced Binary Trees , the Order is O(log n).
...

Read More

###### Asked in Computer Programming, Database Programming, C Programming

### What is the number of nodes in a complete binary tree which has n leaf nodes?

the answer is 2n-1.A complete binary tree will divide each node
into 2 nodes. if you do so u get this answer.
...

Read More

###### Asked in C Programming

### How many leaf nodes does the full binary tree of height h 3 have?

For a full binary tree of height 3 there are 4 leaf nodes. E.g.,
1 root, 2 children and 4 grandchildren.
...

Read More

###### Asked in Computer Programming, Database Programming, C Programming

### Properties of a binary tree?

A binary tree comprises of nodes where each node has a left and
a right leaf. The topmost node is the root. The height of the root
is also the height of the tree. Counting the number of edges to a
node from the root gives the depth of that node.
...

Read More