Types of Binary Trees
1. Strictly Binary Tree-
- If Every non leaf node in binary tree has non empty left and right subtrees ,the tree term as strictly binary tree .
Important Point for Strictly Binary Tree-
- Every non-leaf node has degree 2
- A strictly binary tree with n leaves has (2n -1 ) nodes
- Thus strictly binary tree has odd number of nodes
2. Complete Binary Tree -
- A complete Binary tree of depth d is the strictly binary tree whose all leave are at level d
- A Complete Binary Tree of depth d is the binary tree that contains exactly 2^l (two ki power l nodes )
- Issi prakar kisi bhi complete Binary tree (CBT) mein total no of nodes (2^d+1 -1) where d is depth of tree
- Isse ek conclusion ye nikalta hai ki complete Binary Tree hamesha Strict Binary tree hogi but strict binary tree hamesha complete binary tree (CBT) nhi hogi
- Jaisa ki hum jante hai CBT Hamesha Strict Binary tree hogi tab agar iske n leaves honge to isme total no of nodes 2n-1 honge
