MEENAKSHI SUNDARAJAN ENGINEERING COLLEGE, CHENNAI-24.
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
&
DEPARTMENT OF INFORMATION TECHNOLOGY
QUESTION BANK
Subject Code / Subject Name:CS8391-Data Structures
Year / Sem:II/III
UNIT III - NON LINEAR DATA STRUCTURES – TREES
Tree ADT – tree traversals – Binary Tree ADT – expression trees – applications of trees – binary search
tree ADT –Threaded Binary Trees- AVL Trees – B-Tree – B+ Tree – Heap – Applications of heap.
CO203.3 Implement and apply the non linear data structure tree ADT to problem solutions.
PART A
Q. BT COMPE
QUESTIONS CO PO
No LEVEL TENCE
1. What is the difference between linear and non-linear BTL 4 Analyze C203.3 PO1
data structures?
2. Define Tree. BTL-1 Remember C203.3 PO1
3. Give some applications of Trees. BTL-2 Understand C203.3 PO1
4. Define node, degree, siblings, depth/height, level. C203.3 PO1
BTL-1 Remember
5.3. Define a path in a tree. BTL-1 Remember C203.3 PO1
6.4. Define terminal nodes in a tree. C203.3 PO1
BTL-1 Remember
7. Make a BST for the following sequence of numbers. BTL-6 Create C203.3 PO3
48,39,94,24,78,62,85,29,30,16,41,70,20.
8.5. Define ancestor and descendant. BTL-1 Remember C203.3 PO1
9.6. Define a Binary Tree. BTL-1 Remember C203.3 PO1
10.
7. Define a complete binary tree. C203.3 PO1
BTL-1 Remember
11.
8. State the properties of a Binary Tree. C203.3 PO1
BTL-1 Remember
12. Write an algorithm to declare nodes of a tree BTL-2 Understand C203.3 PO1
structure.
13.
9. How is binary tree represented using an array? Give BTL-2 Understand C203.3 PO1,
an example. PO2
14.
10. What are the different ways of representing a Binary C203.3 PO1
BTL-1 Remember
Tree?
15.
11. Construct an expression tree for the expression A+ BTL-6 Create C203.3 PO3
(B-C)*D*(E+F)
16.
12. Define Traversal. C203.3 PO1
BTL-1 Remember
17. To find inorder, preorder and postorder for a given BTL-5 Evaluate C203.3 PO3
tree.
18. Define a Binary Search Tree. C203.3 PO1
BTL-1 Remember
19. Define AVL tree. C203.3 PO1
BTL-1 Remember
20. What are the drawbacks of AVL trees? BTL-2 Understand C203.3 PO2
21. What is a heap? C203.3 PO1
BTL-1 Remember
22. What is a min-heap? BTL-2 Understand C203.3 PO1
23. Define B-tree? C203.3 PO1
BTL-1 Remember
24. Define Priority Queue? C203.3 PO1
BTL-1 Remember
25. Define Binary Heap? C203.3 PO1
BTL-1 Remember
26. Define Max-heap. C203.3 PO1
BTL-1 Remember
27. Explain AVL rotation. BTL-2 Understand C203.3 PO1
28. What are the different type of Rotation in AVL Tree? BTL-2 Understand C203.3 PO1
29. What is the difference between storing data on the BTL 4 Analyze C203.3 PO1,
heap vs. on the stack? PO2
30. Why it is said that searching a node in a binary BTL 4 Analyze C203.3 PO1,
search tree is efficient than that of a simple binary PO2
tree?
31. Construct a tree for the given inorder and postorder BTL-6 Create C203.3 PO3
traversals. Inorder : DGBAHEICF Postorder :
GDBHIEFCA
32. Define B+ Tree. C203.3 PO1
BTL-1 Remember
33. Construct a binary tree whose nodes in inorder and BTL-6 Create C203.3 PO3
preorder are given as follows: Inorder : 10, 15, 17,
18,20,25,30,35,38,40,50
Preorder: 20, 15, 10, 18, 17, 30, 25, 40, 35, 38, 50
34. What are the properties of Binary Heap? BTL-2 Understand C203.3 PO1
35. Write the difference between B Tree and B+ Tree. BTL 4 Analyze C203.3 PO1,
PO2
PART B
Q. BT COMPE
QUESTIONS CO PO
No LEVEL TENCE
What is Binary Tree? Explain Representation of BTL-2 Understand C203.3 PO1,
1 Binary tree. Also explain different operation that can PO2
be performed on Binary tree.
Explain Inorder, Preorder and Postorder Traversal BTL-2 Understand C203.3 PO1,
2
operation on Binary tree with example. PO2
What is a Binary heap? Explain binary heap? BTL-2 Understand C203.3 PO1,
3 PO2
Explain threaded binary tree with examples. BTL-2 Understand C203.3 PO1,
4 PO2
Narrate the operation of Binary search tree on BTL-2 Understand C203.3 PO1,
5 PO2
searching a node, Insertion node and deletion of a
node from binary search tree with example.
Explain the following routines in AVL tree with BTL-2 Understand C203.3 PO1,
6 example. (i) Insertion, (ii) Deletion, (iii) Single PO2
rotation and (iv) Double rotation.
Explain B+ tree in detail. C203.3 PO1,
7 BTL-2 Understand PO2
Explain with suitable examples the basic heap C203.3 PO1,
8 operations and write algorithms for the same. BTL-2 Understand PO2
9 Explain B Tree in detail with example. BTL-2 Understand C203.3 PO1,
PO2
Define AVL tree and starting with an empty AVL BTL-6 Create C203.3 PO3
10
search tree, insert the following elements in the
given order 35,45,65,55,75,15,25.
PART C
Q. BT COMPE
QUESTIONS CO PO
No LEVEL TENCE
1. Explain AVL tree in detail and construct the AVL tree BTL-6 Create C203.3 PO3
for the following : 10,2,8,12,11,15,7 and 9.
2. Illustrate the construction of tree of a binary tree BTL-6 Create C203.3 PO3
given its in order and postorder traversal and find
preorder.
in-order: H D I J E K B A L F M C N G O
Post-order: H I D J K E B L M F N O G C A
3. Construct a B-tree with order m=3 for the key values BTL-6 Create C203.3 PO3
2,3,7,9,5,6,4,8,1 and delete the values 4 and 6. Show
the tree in performing all operations.
4. Construct a Min and MAX heap for the following BTL-6 Create C203.3 PO3
values. 23,67,1,45,7,89,56,35
5. Show the results of inserting 43,11,69,72 and 30 into BTL-6 Create C203.3 PO3
an initially empty AVL tree. Show the results of
deleting the nodes 11 and 72 one after the other of
constructed tree.
6. Make a BST for the following sequence of numbers. BTL-6 Create C203.3 PO3
45,32,90,34,68,72,15,24,30,66,11,50,10 Traverse the
BST created in Preorder, Inorder and Postorder.
