The GATE Grind

GATE 2007 CS – Question 13

Programming and Data Structures · Trees and Binary Search Trees · 1 mark · Multiple choice

How many different binary trees can be formed with three unlabeled nodes?

  1. 1
  2. 5
  3. 4
  4. 3

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) 5

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Trees and Binary Search Trees questions

All Trees and Binary Search Trees questions →