4,429 views
2 votes
2 votes
Let T be a rooted binary tree whose vertices are labelled with symbols a, b, c, d, e, f, g, h, i, j, k. Suppose the in-order and post-order traversals of T produce the following sequences.
in-order:  a, b, c, d, e, f, g, h, i, j, k
post-order: a, c, b, e, f, h, j, k, i, g, d
How many leaves does the tree have?

3 Answers

3 votes
3 votes

5 will be answer 

Related questions

2 votes
2 votes
3 answers
1
Parshu gate asked Nov 13, 2017
2,937 views
For a binary tree T,preorder traversal yields: 11,8,6,4,7,10,19,43,31,29,37,49 andinorder traversal yields: 4,6,7,8,10,11,19,29,31,37,43,49The height of the T is _____...
0 votes
0 votes
1 answer
2
2 votes
2 votes
2 answers
4
GO Classes asked Feb 4
274 views
Consider a binary tree. Among the following traversal combinations, which of them can uniquely construct the tree?Inorder + PreorderPreorder + PostorderOnly InorderInorde...