How many 3-node binary trees are possible,if the postorder traversal is xyz?
Answers
Answered by
0
Answer:
2
Explanation:
hello as in post order we traverse it in order :left-right -root .
so we cannot change z from last position of traversal we can change position of x and y .
so the two possible traversal is ;
1)xyz
2)yxz
Similar questions