Northern India Engineering College, Shastri Park, New Delhi
Department of Information Technology
Assignment 2: DATA STRUCTURES
SECTION-S9,S3
Code ETCS – 209
Marks: 05
Course Facilitator: Ms. LALITA LUTHRA, Assistant Professor-IT
Note: i) Last date of submission: 18/09/2015.
ii) Only hand written assignment will be accepted on & before the due
date.
iii) No assignment will be accepted after due date.
iv) Do not submit copied assignment.
QUES 1. Explain the strictly binary tree ,almost complete binary tree with
an example of atleast 7 nodes.
QUES 2. Draw a binary tree whose depth first and symmetric order
traversal are :
Depth First Order:ABCGDEFHIJ
Symmetric Order: CGBDAFHEJI
QUES 3. Suppose the following list of values is inserted in order into an
empty BST
3,4,8,10,1,0,5,7,9,11,18
a) Find the final BST , T.
b) Find the inorder traversal of T.
QUES 4. Explain AVL Trees. Construct an AVL tree with the following
elements in order of their occurance:
64,1,44,26,13,110,98,85.
QUES 5. What is Heap?Build a Max heap for following list of numbers:
44,30,50,22,60,55,77,55
QUES 6. Define with example a Threaded Binary tree.