What is difference between a complete binary tree and strictly binary tree?

[Vuhelper]

View more random threads:

• what is difference between Data Members and Members...
• arithmetical operator in c++ may 2011
• using namespace std;"in the code can we compile the...
• comkplie karta hn to wo save hony k liye location deta hy...
• Balance of the AVL tree im Data structure 2012
• i got the conecpt of string array as i asked before but i...
• Read data from file into arrays in c++ 2011
• Dangling pointer memory leakage Data operations
• what is cursor and why we use it. what is difference...
• protected inheritance and abstract classes in C++ 2012

In complete binary tree, every level is completely filled with the exception of bottom level.
In strictly binary tree, every node has either zero or two child nodes, i.e; no node can have one child node.

Consider the following binary tree:
3
/ \
2 1
/
4

Now this is complete binary tree as every level is completely filled except the bottom level (bottom level can be completely filled but it is not required). But it is not strictly binary tree as node 2 has only one child.

Sponsored Links

Consider this one:
3
/ \
2 1
/\
4 5
This is complete binary tree and also strictly binary tree.


And this binary tree:
3
/ \
2 1
/\ /\
4 5 6 7
It is also complete binary tree and also strictly binary tree.

But this binary tree:
3
/ \
2 1
/\
4 5
/\
8 9
It is not complete binary tree as every level is not completely filled, node 1 does not have any child nodes. It is a strictly binary tree as every node has either zero or two child nodes.