Scribd
Upload
6 views1 page

Tree Questions

The document contains exercises related to tree data structures, including constructing binary trees from given preorder and inorder traversals, defining binary search trees, and drawing trees from prefix and postorder expressions. It provides specific data sets for constructing these trees and asks for explanations of concepts. The exercises involve multiple trees and traversal methods, demonstrating various tree construction techniques.

Uploaded by

harshitchoudhary978
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views1 page

Tree Questions

The document contains exercises related to tree data structures, including constructing binary trees from given preorder and inorder traversals, defining binary search trees, and drawing trees from prefix and postorder expressions. It provides specific data sets for constructing these trees and asks for explanations of concepts. The exercises involve multiple trees and traversal methods, demonstrating various tree construction techniques.

Uploaded by

harshitchoudhary978
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

(b) Given the in order and preorder traversal of tree, construct 6

the tree.
Preorder : A, B, D, E, F, C, G, H, J, L, K
In order : D, B, F, E, A, G, C, L, J, H, K.
4.(a) What is a Binary Search Tree? Explain. Construct a BST 7
from the following data :
43, 49, 9, 20, 33, 31, 2, 4, 1, 57, 47, 55.
5.(a) Draw a tree from given inorder and preorder transversal of 4
binary tree.
Inorder :- HDIBJEKAFCG
Preorder :- ABDHIEJKCFG
(b) Draw a tree to represents following prefix expression. 4
- * + abc/df
Draw the tree for the following prefix expression. 6
*a+b*c-de
*a+*b-cde
5.(a) Draw a tree from given inorder and preorder traversal of 4
binary tree.
Inorder :- HDIBJEKAFCG
Preorder :- ABDHIEJKCFG
(b) Drew a tree from given the given prefix expression - * + abc / 4
df
(b) Construct a binary tree whose inorder and post order is given 6
below
INORDER : HDIBJEKAFCG
POSTORDER : ABDHIEJKCFG
9. Construct a binary tree whose inorder and postorder in given 6
(a) below :
INORDER : H D I B J E K A F C G
POSTORDER : A B D H I E K C F G

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy