Question: A binary tree T has 9 nodes. The in-order and pre-order traversals of T yield the following sequence of nodes: In-order: E A C K
A binary tree T has 9 nodes. The in-order and pre-order traversals of T yield the following sequence of nodes:
| In-order: | E A C K F H D B G |
| Pre-oder: | F A E K C D H G B |
Draw the tree T. Describe your reasonings or algorithm on how you obtained the tree.
Subject:Data Structure & Alograthim
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
