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.