Tessellate S.T.E.M.S - Computer Science - College - Set 1 - Problem 1
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 (visit left subtree, visit root, visit right subtree) and post-order (visit left subtree, visit right subtree, visit root) 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?
This problem is a part of Tessellate S.T.E.M.S.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!