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.
Q & A › Category: Data Structure › 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.
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