Non Linear Data Structure
Non Linear Data Structure
Non Linear Data Structure
• The set of all nodes at a given depth is called the level of the tree.
The root node is at level zero.
A Binary Tree is perfect binary tree if every internal node has exactly 2
children and all the leaf node are at the same levels.
Types of binary tree
A Binary Tree is a complete Binary Tree if All the levels are completely
filled except possibly the last level. The last level must be strictly filled
from left to right.
Binary tree
Complexity
• Refer class notes