Please help me out , how did u approach this problem?

The Gateway to Computer Science Excellence

+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?

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 votes

52,223 questions

59,811 answers

201,020 comments

118,087 users