If every non-leaf node in a binary tree has non-empty left and right subtrees, the tree is termed a strictly binary tree. There are a number of operations that can be defined for a binary tree.

1. Class No.11 Data Structures http://ecomputernotes.com

10. Binary Tree D H F G I Left subtree root Right subtree http://ecomputernotes.com A B C E

19. Binary Tree: Terminology D H F G I parent Left descendant Right descendant Leaf nodes Leaf nodes http://ecomputernotes.com A B C E

22. Level of a Binary Tree Node D H F G I 1 0 1 2 2 2 3 3 3 Level 0 Level 1 Level 2 Level 3 http://ecomputernotes.com A B C E

24. Complete Binary Tree Level 0: 2 0 nodes H D I E J K L F M G N O Level 1: 2 1 nodes Level 2: 2 2 nodes Level 3: 2 3 nodes http://ecomputernotes.com A B C