• Embed Doc
  • Copy Link
  • Readcast
  • Collections
  • 1
    CommentGo Back
Download
 
 suvayanbala@gmail.com 9231937821
Page
|
1
 
Types of Binary Tree
 
A tree is a
binary tree
if and only if :-
–
 
It has a root node , which may not have any child nodes
(0 childnodes, NULL tree)
–
 
Root node may have 1 or 2 child nodes . Each such node forms abinary tree itself 
–
 
Number of child nodes can be
0 ,1 ,2.......not more than 2
–
 
There is a unique path from the root to every other node
E.g. :-
 
A binary tree is a
strictly
binary tree if and only if :-
–
 
Each node has
exactly two
child nodes or
no
nodes
E.g.:-
 
A binary tree is a
full
binary tree if and only if :-
–
 
Each non leaf node has
exactly two
child nodes
–
 
All leaf nodes are at the
same level
 
 
 suvayanbala@gmail.com 9231937821
Page
|
2
 
E.g.:-
•
 
A binary tree is a
perfect
binary tree if and only if :-
–
 
is a
full binary tree
 
–
 
All leaf nodes are at the
same level
 
E.g.:-
 
A binary tree is a
complete
binary tree (
of height h ,
we take root nodeas 0 ) if and only if :-
–
 
Level 0 to h-1 represent a
full binary tree
of height h-1
–
 
One or more nodes in level h-1 may have 0, or 1 child nodes
–
 
If 
 j,k
are nodes in level h-1, then
 j
has more child nodes than k if and only if 
 j
is to the left of k ,
i.e. the last level (h) can be missingleaf nodes, however the ones present must be shifted to the left
 
 suvayanbala@gmail.com 9231937821
Page
|
3
 
E.g.:-
A complete binary tree filled at each depth from left to right
of 00

Leave a Comment

You must be to leave a comment.
Submit
Characters: ...
You must be to leave a comment.
Submit
Characters: ...