The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B,C is ?
(2n)!/(n+1)!*n! so n=3 we get 5 answer is d
Serkie Mekonnen from Dessie, Ethiopia is saying 5 is correct answer
Narender Kumar is saying 9 is correct answer
Marem Husen from Al Musayyib, Iraq is saying 9 is correct answer
deepak kumar is saying 7 is correct answer
- [A] Intertel
- [B] Telenet
- [C] VoIP
- [D] VoRP
- [A] Optimal binary search tree construction can be performed efficiently using dynamic programming.
- [B] Breath first search cannot be used to find converted components of a graph.
- [C] Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
- [D] Depth first search can be used to find connected components of a graph.
- [A] Stack
- [B] Set
- [C] List
- [D] Queue