Strict binary tree | Proper binary tree | Complete binary tree

 A binary tree that has all nodes with exactly 0 or 2 child nodes is called strict binary tree.


Height vs Nodes : 

Internal Nodes vs External Nodes : 

Number of external nodes = Number of internal nodes + 1






Comments

Popular posts from this blog

SQL basic interview question

gsutil Vs Storage Transfer Service Vs Transfer Appliance