Full Binary Tree & Complete Binary Tree
Full Binary Tree & Complete Binary Tree
Full Binary Tree : A node should be either a leaf node or it should have both the left and right children at each level.
Complete Binary Tree : a binary tree T with n levels is complete if all levels except possibly the last are completely full,and the last level has all its nodes to the left side.
Full Binary Tree : A node should be either a leaf node or it should have both the left and right children at each level.
Complete Binary Tree : a binary tree T with n levels is complete if all levels except possibly the last are completely full,and the last level has all its nodes to the left side.
Related Posts
Subscribe to:
Post Comments
(
Atom
)
No comments :
Post a Comment