Binary Trees and Tree Algorithms

Casual Mode - Take your time!

1 / 15
✓
Correct
0
✗
Incorrect
0
★
Score
0%
Multiple Choice

Which of the following statements is wrong about trees?

  1. A binary tree is the one in which the internal nodes have atmost two children.
  2. File system in unix OS make use of trees.
  3. In a complete binary tree, the number of internal nodes is 1 less than the number of leaves.
  4. In a binary tree, the number of internal nodes is greater than the number of leaves.
  5. A tree with n nodes can have a maximum height n -1.
Change Mode