Question
Draw the binary tree for which the traversal sequences are given as follows:
(i) Post order: DHKECFMNLGBA
In order: DCHEKAFBMLNG
(ii) Pre order: ABCDEFGHJK
In order: B-D-C-E-A-G-H-K-F
Answer :
Word Count : 728
To construct a binary tree from given traversal sequences, we use the properties of each traversal method. Post-order traversal visits nodes in the order Left → Right → Root, in-order traversal visits nodes Left → Root → Right, and pre-order traversal visits nodes Root → Left → Right. Using these rules, we can reconstruct the tree step by step. --- (i) Post-order: DHKECFMNLGBA, In-order: DCHEKAFBMLNG 1. Identify the root: In post-order, the last element is always the root of the tree. Here, post-order ends with `A`. So `A` is the root. 2. Divide the in-order sequence: In in-order, elements left of the root are in the left subtree, and elements right of the root are in the right subtree. In-order: `D C H E K A F B M L N G` * Left subtree in-order: `D C H E K` * Right subtree in-order: `F B M L N G` 3. Left subtree reconstruction: Post-order for left subtree (from original post-order, removing the root `A`): `D H K E C F M N L G B` → the left subtree nodes ______ __________ ___ ___ _________.
______ ______ ___ ___ ___ ________ _________ ___ __________.
___ _________ _________ _________ _________ _________ ________ ________ __________.
___ ________ ________ _____ ____ _______ ________ ______ ________.
___ _______ ___ _______ ____ ____ __________ ______ ___ _____.
___ _________ ________ _______ ______ ________ ____ _______.
_____ ______ _____ ______ _______.
___ ______ ________ ________ _______ __________.
_____ ___ ____ ___ __________ __________.
______ _______ _____ _____ ___ ___ ______ _____ _____ ___.
______ ___ ____ _______ ________.
_________ _______ _________ _____ _______.
_________ ____ _______ ____ __________.
_______ ___ ___ ___ _________ ______ __________ _________.
___ _______ _______ ____ __________.
________ _________ __________ ______ _____ ________ ___ ___.
____ _________ __________ ____ ___ ________ ______ __________ _________ ______ _________.
_________ _________ ____ ________ __________ ___ _______ _____ _______ __________.
________ ______ _____ _____ ________ ____.
____ _______ _______ _______ __________ ______ ___ __________ __________ ________.
________ ______ ________ _______ ________ __________ ______ _______.
______ _____ ____ __________ _________ _________.
________ __________ _________ _________ ________ _________ __________.
___ ________ _____ ______ ___.
________ ________ __________ ___ ____ _______ _____ _______ _______ _____ __________.
_______ _____ ______ ______ ___ __________ _______ _________ __________ ___.
________ ______ ______ __________ _________ ____ ______ ________ ___.
_________ __________ ______ _________ ________ ______ ___ _______ ____.
_______ _________ _____ ___ ____ _________ _________.
_____ _________ ____ ____ ______ _________ ________ _________ _________ __________ ___ ________.
______ _______ ____ ________ _____ _______ ____.
________ _______ __________ ________ _________ _______ ________ __________ _______ ________ _________.
_______ __________ ________ ______ ________ ____ ________ _______ __________ ____ ______.
___ __________ _________ _______ _________ ______ ________ ____ _________ ________.
__________ _________ ___ ______ __________.
_________ ____ _____ _____ _______ _________ ______ ______ _______ ____ __________.
_________ ____ ________ _____ ___.
_____ ___ ___ ____ ____ _____ ________.
____ ____ ______ _________ __________ _____ ______ ______ _____ ________ _______.
________ _______ _____ _________ ____ ______ _________ _______ _______ _________.
_________ __________ ___ ___ __________ ___ ___ ________ _____.
_________ __________ ____ _______ _____ ___.
_______ _________ ____ ____ __________ ________ ________ _________ _______ ____ _____ _____.
_____ _____ ___ _____ __________ ________ ______ _________ _________.
___ ________ _________ ______ _____ _______ _______ ___ ___ __________ _____ __________.
_________ ________ ___ ______ ___ ________ _________ ___ ______ ___.
_________ _____ ______ __________ ________ ______ _______ ________ _________ _____ __________.
______ _____ __________ _____ ________ ______ __________.
_____ ____ ________ __________ _____ _________ _______.
_____ ________ _________ ____ ___ ______.
____ _____ _____ ___ _______ ________ ________ _____.
________ ______ _________ _____ ____ _____ __________ __________ _____ ___ __________.
_________ ________ _____ __________ ___ ______ _____ _____ _______ _______ ____.
_________ __________ ________ ____ ______.
______ _________ __________ _____ _____ ___ ________ _____ ____ ____ ________ ______.
____ ___ _______ _________ ____ ___ __________ __________.
________ ________ ________ ______ ___.
_______ ___ __________ ________ __________ _________ ___ ___ _________ ________ _________ ________.
_________ ________ _____ _____ ____.
_____ ________ _________ ______ ______ __________.
_______ _____ __________ ____ _______ ______ ___ ________ ____ _____ ________.
__________ _________ ___ ______ ________ ________ _____ _________ ___ ______ _________ ______.
_____ ___ ____ _________ ____ _____ __________ _________ _________.
__________ _______ __________ _____ __________ ____ ____ ___ ___ _________ __________ ____.
___ _______ _____ _________ _____.
____ __________ __________.
Get Full Answer on WhatsApp
To construct a binary tree from given traversal sequences, we use the properties of each traversal method. Post-order traversal visits nodes in the order Left → Right → Root, in-order traversal visits nodes Left → Root → Right, and pre-order traversal visits nodes Root → Left → Right. Using these rules, we can reconstruct the tree step by step. --- (i) Post-order: DHKECFMNLGBA, In-order: DCHEKAFBMLNG 1. Identify the root: In post-order, the last element is always the root of the tree. Here, post-order ends with `A`. So `A` is the root. 2. Divide the in-order sequence: In in-order, elements left of the root are in the left subtree, and elements right of the root are in the right subtree. In-order: `D C H E K A F B M L N G` * Left subtree in-order: `D C H E K` * Right subtree in-order: `F B M L N G` 3. Left subtree reconstruction: Post-order for left subtree (from original post-order, removing the root `A`): `D H K E C F M N L G B` → the left subtree nodes ______ __________ ___ ___ _________.
______ ______ ___ ___ ___ ________ _________ ___ __________.
___ _________ _________ _________ _________ _________ ________ ________ __________.
___ ________ ________ _____ ____ _______ ________ ______ ________.
___ _______ ___ _______ ____ ____ __________ ______ ___ _____.
___ _________ ________ _______ ______ ________ ____ _______.
_____ ______ _____ ______ _______.
___ ______ ________ ________ _______ __________.
_____ ___ ____ ___ __________ __________.
______ _______ _____ _____ ___ ___ ______ _____ _____ ___.
______ ___ ____ _______ ________.
_________ _______ _________ _____ _______.
_________ ____ _______ ____ __________.
_______ ___ ___ ___ _________ ______ __________ _________.
___ _______ _______ ____ __________.
________ _________ __________ ______ _____ ________ ___ ___.
____ _________ __________ ____ ___ ________ ______ __________ _________ ______ _________.
_________ _________ ____ ________ __________ ___ _______ _____ _______ __________.
________ ______ _____ _____ ________ ____.
____ _______ _______ _______ __________ ______ ___ __________ __________ ________.
________ ______ ________ _______ ________ __________ ______ _______.
______ _____ ____ __________ _________ _________.
________ __________ _________ _________ ________ _________ __________.
___ ________ _____ ______ ___.
________ ________ __________ ___ ____ _______ _____ _______ _______ _____ __________.
_______ _____ ______ ______ ___ __________ _______ _________ __________ ___.
________ ______ ______ __________ _________ ____ ______ ________ ___.
_________ __________ ______ _________ ________ ______ ___ _______ ____.
_______ _________ _____ ___ ____ _________ _________.
_____ _________ ____ ____ ______ _________ ________ _________ _________ __________ ___ ________.
______ _______ ____ ________ _____ _______ ____.
________ _______ __________ ________ _________ _______ ________ __________ _______ ________ _________.
_______ __________ ________ ______ ________ ____ ________ _______ __________ ____ ______.
___ __________ _________ _______ _________ ______ ________ ____ _________ ________.
__________ _________ ___ ______ __________.
_________ ____ _____ _____ _______ _________ ______ ______ _______ ____ __________.
_________ ____ ________ _____ ___.
_____ ___ ___ ____ ____ _____ ________.
____ ____ ______ _________ __________ _____ ______ ______ _____ ________ _______.
________ _______ _____ _________ ____ ______ _________ _______ _______ _________.
_________ __________ ___ ___ __________ ___ ___ ________ _____.
_________ __________ ____ _______ _____ ___.
_______ _________ ____ ____ __________ ________ ________ _________ _______ ____ _____ _____.
_____ _____ ___ _____ __________ ________ ______ _________ _________.
___ ________ _________ ______ _____ _______ _______ ___ ___ __________ _____ __________.
_________ ________ ___ ______ ___ ________ _________ ___ ______ ___.
_________ _____ ______ __________ ________ ______ _______ ________ _________ _____ __________.
______ _____ __________ _____ ________ ______ __________.
_____ ____ ________ __________ _____ _________ _______.
_____ ________ _________ ____ ___ ______.
____ _____ _____ ___ _______ ________ ________ _____.
________ ______ _________ _____ ____ _____ __________ __________ _____ ___ __________.
_________ ________ _____ __________ ___ ______ _____ _____ _______ _______ ____.
_________ __________ ________ ____ ______.
______ _________ __________ _____ _____ ___ ________ _____ ____ ____ ________ ______.
____ ___ _______ _________ ____ ___ __________ __________.
________ ________ ________ ______ ___.
_______ ___ __________ ________ __________ _________ ___ ___ _________ ________ _________ ________.
_________ ________ _____ _____ ____.
_____ ________ _________ ______ ______ __________.
_______ _____ __________ ____ _______ ______ ___ ________ ____ _____ ________.
__________ _________ ___ ______ ________ ________ _____ _________ ___ ______ _________ ______.
_____ ___ ____ _________ ____ _____ __________ _________ _________.
__________ _______ __________ _____ __________ ____ ____ ___ ___ _________ __________ ____.
___ _______ _____ _________ _____.
____ __________ __________.
Get Full Answer on WhatsApp
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★