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

12 Sep 2025
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
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★
Top
📞
Call Support Instant phone assistance  Draw the binary tree for which the traversal sequences are given
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→