Reg No / Roll No

RENGANAYAGI VARATHARAJ COLLEGE OF ENGINEERING

SALVARPATTI, SIVAKASI – 626 128
B.E/B.Tech Degree Examinations –NOV/DEC2022

QUESTION PAPER CODE: DS1

UNIT-III Date:
CS3351 – DATA STRUCTURES
Year & Sem: II /III Time : 1.5 hrs
Branch: CSE/ECE
Total Marks : 50 Marks
________________________________________________________________________________________________
PART A [Answer All Question] (5×2=10)
1. Define non-linear data structure?
2. What are the applications of binary tree?
3. What is the length of the path in a tree?
4. What is meant by binary search tree?
5. What is binary heap?
PART B [Answer All Question] (2×13=26)
6. (a) Construct an expression tree for the expression (a+b*c) + ((d*e+f)*g). Give the outputs when you
apply inorder, preorder and postorder traversals. (13) (OR)
(b) Create a binary search tree for the following numbers start from an empty binary search tree.
45,26,10,60,70,30,40 Delete keys 10,60 and 45 one after the other and show the trees at each stage.(13)
7. (a) Explain the tree traversal techniques with an example. (13)(OR)
(b) (i)What are AVL trees? Describe the different rotations defined for AVL tree. (7)
(ii)Insert the following elements step by step in sequence into an empty AVL tree
15,18,20,21,28,2330,26 (6)
PART C (1×14=14)
8. Consider the binary search tree given below. Find the result of in-order, pre-order, and post-order
traversals. Show the deletion of the root node Insert 11, 22, 33, 44, 55, 66, and 77 in the tree.

Prepared by Verified by Approved by