Full Binary Tree in Data structure by R4R Team

-Each node in Full Binary Tree have exactly 2 child.
-Or degree of each node of full binary tree is 0 or 2.
-parent of node i is i/2, unless i=1
-left child of node i is node 2i, unless 2i>n, where n is the number of nodes.
-right child of node i is node 2i+1,unless 2i+1>n

Difference Between Full Binary Search and Complete Binary Tree:
Balancing factor of every node in Full binary tree is always 0
while in complete binary tree, balancing factor may be 0 or 1

Leave a Comment:
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!