Draw the binary tree for which the traversal sequences are given as follows:
(i) Pre order: ABDEFCGHIJK
In order: BEDFACIHKJG
(ii) Post order: IJHDKECLMGFBA
In order: I HJDCKEAFLGMB
(i) Given: Preorder: `A B D E F C G H I J K` Inorder: `B E D F A C I H K J G` To reconstruct the binary tree: Step 1: In preorder, the first element is the root → `A` Find `A` in inorder → Left subtree = `B E D F`, Right subtree = `C I H K J G` Step 2: Left subtree (inorder = `B E D F`) From preorder, next root = `B`, but `B` is first in inorder → must be leaf. Next in preorder: __________ ________ ______ ______ _______ _______ ______ _________ ___.
____ ______ ___ _________ _______ _________.
_____ ___ ____ _________ ___ ________ _______ ___ __________ _______.
______ _________ _______ _____ ______ _______ __________.
_________ __________ _______ _________ ______ ____ _________.
___ __________ _______ __________ ___ __________ ________ _________ ____ _______.
____ __________ __________ _______ _____ _______ _____ __________.
________ _______ __________ _____ _________ ________ _____.
_________ _________ _________ ___ _____ _____ _______.
___ ______ ________ ___ ______ ______ ______ ________ __________ ______ _____ _______.
______ _____ ____ _________ _________ __________ ________ ____ ___ ___ ____ ____.
______ _______ _____ ________ ____ ________ ________ __________ ___.
_________ ___ ____ _______ ______ ____ ______ ____ ________ _______ _____ _________.
________ _______ _______ ____ _________ __________ _______.
_____ _____ __________ _____ ____ _____ ____ ______.
____ _____ ___ ____ __________.
_________ __________ ________ ___ __________ _____ _______ _________ ___ _______.
___ _______ ________ _____ ________ __________ _________.
_____ ___ ____ ______ ________ ________ _______ ___ __________ _________.
___ ________ _________ __________ __________ ____ ___ ___ ___ _______.
___ _____ ________ _________ ________ ___ _______ _______ ___ ______ ___ _____.
______ ____ ____ _____ ______ _____ _____ _______ _______.
___ ____ _____ ___ _______ ________ _________ ______ _________ ________ _____ _______.
_______ __________ _________ _________ ________ _________.
____ _______ ___ ________ _____ _________ ______ _________ _________ _________.
________ _______ _____ _____ ____ __________ ____.
_____ ____ ____ _______ _______ ___ ______.
___ ______ _____ ______ ___.
_________ ____ _________ _____ ___.
_________ ______ ______ __________ _________ ______ _______ ________ ________ _________ ________.
________ ______ _______ ______ _______ __________ ______.
_____ _________ ______ ________ _______ __________ ______.
________ __________ ___ _________ _____ ______ _____ __________ __________.
______ _________ _____ ____ _________.
_______ _______ ______ ___ ________ __________.
_____ _________ __________ ________ ____ ______.
________ ____ ________ _________ ____.
______ ______ _______ ______ _________ ______ _____ _____ _________ ______ _____.
_________ ______ ___ __________ _______.
______ ________ _______ ______ ______.
__________ ___ _______ __________ _______ ___.
___ ________ ______ ______ _________ ________ _____ ____ _______ __________ ___.
________ _____ ___ _______ _______ _____ ________ ___ ______ ____ _________ ______.
__________ _______ _________ _________ _____.
___ ______ ___ _______ ___ ________ ____ _______.
______ _____ _____ ________ ________ _______ ___ ___ ______ ___.
_______ _____ ______ __________ _________.
_______ ________ __________ _____ ______.
________ __________ ______ ___ _________ _________ ___ ______ _________ ___ ______.
_______ ___ ___ ___ ________ __________ ___ __________ ________ ________.
__________ _______ _____ __________ ____ ______ _____ __________ _____ _______.
______ ________ __________ _____ _______.
__________ ___ ______ ________ _______ _______ _____ ____.
____ _______ ___ _________ ______ ______ ________ _____ __________ _______ _________.
_______ _____ ____ __________ ___ __________.
_______ ________ _____ ___ ______ __________ ____ ______ __________ _______ _____ ____.
_______ ____ _______ __________ _________ ________ ____ _____ _______.
Get Full Answer on WhatsApp
What is Red-Black tree? Explain insertion and deletion operations in a Red-Black tree with the help of a suitable example.
Write a program in 'C' language for 2-way merge sort.
Explain Direct File and Indexed Sequential File Organization.
Apply Dijkstra's algorithm to find the shortest path from the vertex 'S' to all other vertices for the following graph:
Draw the binary tree for which the traversal sequences are given as follows:
(i) Pre order: ABDEFCGHIJK
In order: BEDFACIHKJG
(ii) Post order: IJHDKECLMGFBA
In order: I HJDCKEAFLGMB
What is a heap tree? Create a max heap tree for the following list of items inserted in the order. Also, explain the heap sort with the help of thus created heap tree. 10, 20, 5, 25, 30, 18, 3, 70, 55, 45, 12, 24
Apply Prim's Algorithm to find the minimum spanning tree for the following graph.
Apply Insertion and Selection sorting algorithms to sort the following list of items. So, all Intermediate steps. Also, analyze their best, worst and average case time complexity.
12, 5, 2, 15, 25, 30, 45, 8, 17, 50, 3, 7