Data Structures and Algorithms - Trees

18. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves

  • Option : B
  • Explanation : A strictly binary tree with 'n' leaves must have (2n � 1) nodes. Verify for some small 'n'. This can be proved by the principle of mathematical induction.
Cancel reply
Cancel reply

19. Number of possible binary trees with 3 nodes is

Cancel reply
Cancel reply