GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

The maximum number of binary trees that can be formed with three unlabeled nodes is:

A

1

B

5

C

4

D

3

asked in trees, binary search trees, binary heaps by gate

1 Answer

0 votes

all possible unlabeled binary trees

             O
          /     \
        O        O
           (i)

            O
          /
       O
     /
   O
        (ii)

         O
       /
     O
        \
          O
       (iii)

  O
     \
       O
          \
           O
    (iv)

       O
          \
            O
          /
       O
    (v)
answered by gate

Related questions

The best answer to any question