+1 vote
in Data Structures & Algorithms I by (110k points)
What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order.

(a) 15

(b) 3

(c) 5

(d) 8

The query is from Binary Trees topic in chapter Binary Trees of Data Structures & Algorithms I

The question was asked in exam.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right option is (c) 5

The explanation is: 5 binary trees are possible and they are,

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.