Scribd
Upload
15 views5 pages

UNIT-IV-Question Bank

Uploaded by

Anushka kolte
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
15 views5 pages

UNIT-IV-Question Bank

Uploaded by

Anushka kolte
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/ 5

JSPM’s

Jayawantrao Sawant College of Engineering, Hadapsar,Pune


Department of Information Technology
Class – SE (IT)
Question Bank –Data Structure and Algorithms

UNIT-IV-TREES

Q. No. Question Description Marks CO PSO PO CL


1. Construct binary tree from the given 8 4 PSO1, PO1, 3
PSO2 PO2
traversals: [5]
Postorder: H I D E B F G C A
Inorder: H D I B E A F C G
2. Explain binary search tree in detail. 9 4 PSO1, PO1, 3
PSO2 PO2,
Draw the BST for given nodes: [5]
PO3
38, 14, 56, 23, 82, 8, 45, 70, 18, 15
3. What is TBT? What is advancement in TBT 8 4 PSO1 PO1, 2
over BT? Explain threaded binary tree with PO2
example.
4. Write a recursive preorder, inorder and 9 4 PSO1, PO1, 2
postorder binary tree traversal techniques PSO2 PO2
algorithm. Traverse a given binary tree in
Inorder, Preorder and Postorder:

5. Differentiate general tree and binary tree. 8 4 PSO1, PO1, 2


PSO2 PO2
Convert given general tree to binary tree and
write down steps required for the same.
6. Construct binary tree from the preorder and 8 4 PSO1, PO1, 3
inorder traversal. PSO2 PO2 [5]
Preorder: J C B A D E F I G H
Inorder: A B C E D F J G I H

7. Write a non-recursive algorithm to find 8 4 PSO1 PO1 2


the pre-order and inorder traversal of a
binary tree.
8. Traverse a given tree in Preorder, Inorder and 8 4 PSO1, PO1, 3
Postorder. PSO2 PO2

9. Construct binary tree from the given traversal: 8 4 PSO1, PO1, 3 [5]
PSO2 PO2
a)

Preorder: * + a - b c / - d e - + f g h
Inorder: a + b - c * d - e / f + g - h
b)

Inorder: H D I B E A J F K C G
Postorder: H I D E B J K F G C A

10. Draw the BST for the following given nodes. 8 4 PSO1, PO1, 3 [5]
45, 7, 21, 76, 1, 54, 22, 4, 86 PSO2 PO2,
PO3
11. Write C++ function for implementation of In- 8 4 PSO1 PO1, 3
order traversal of in-order threaded binary PO2
tree.

12. Suppose the following sequence lists the 9 4 PSO1, PO1, 3


nodes of a binary tree in preorder and inorder PSO2 PO2,
respectively. PO3
Preorder - G B Q A C K F P D E R H
Inorder - Q B K C F A G P E D H R
Construct a binary tree from the given
traversals.

13. Write a note non-recursive function to delete a 8 4 PSO1 PO1, 2


node in the BST. PO2
14. Explain the difference between array 9 4 PSO1 PO1, 5
representation and linked representation of PO2
binary tree. Justify your answer using suitable
example of each.

15. What are the advantages (merits) and 8 4 PSO1 PO1, 2


disadvantages (demerits) of TBT? PO2
Write an algorithm to implement Inorder
Traversal of Inorder TBT.

16. Construct a binary tree from the given 9 4 PSO1, PO1, 3


traversals. PSO2 PO2,
Pre-order: * + a – b c /– d e – + f g h PO3
In-order : a + b – c * d – e/f + g – h
17. What is a Binary Tree? Explain the 8 4 PSO1 PO1, 2
following operations on Binary Tree: PO2
i) Inserting a node in to BT
ii) Deletion a node from BT
18. What is the use of threaded binary free? 9 4 PSO1 PO1, 2
Give the node structure required for a PO2
threaded binary tree. Write pseudo code
to find in-order successor of any node X
in a threaded binary tree.
19. Write a pseudo code to implement binary 8 4 PSO1 PO1, 2
search tree for performing following PO2
operations :
i) Display - Mirror image
ii) Display - Minimum value
iii) Display average value
iv) Display leaf nodes
20. Explain binary search tree in detail. 8 4 PSO1, PO1, 3
PSO2 PO2,
Draw the BST for given nodes: [5]
PO3
38, 14, 56, 23, 82, 8, 45, 70, 18, 15
21. Describe the characteristics of a general tree. 8 4 PSO1, PO1, 3
PSO2 PO2,
Convert the following general tree into a
PO3
binary tree.
22. Discuss the time complexities of inserting & 4 4 PSO1 PO1, 2
PO2
deleting a node from BST.

23. Discuss the applications of Binary search tree 4 4 PSO1 PO1 3


& expression tree.

24. Write sudo code for non-recursive inorder tree 6 4 PSO1 PO1, 3
PO2
traversal of binary tree.

25. For the following binary tree, show (draw) 6 4 PSO1, PO1, 3
PSO2 PO2,
threaded binary tree (inorder).
PO3
Blooms
level no Blooms Taxonomy
terms

2
1

Note:
1. Example demonstrates the method for filling the data.
2. Blooms Taxonomy is provided for Ready Reference.

Subject In-charge HOD

You might also like