COMSATS University, Islamabad

Islamabad Campus
Department of Computer Science

Read before Attempt

Assignment No. 4: TREE, GRAPH, HASHING
Course code and Title: CSC211, Data Structure and Algorithm
Instructor: Tanveer Ahmed
Assigned Date: December 2, 2019 Due Date: December 18,2019
Total Marks: --
CLO-4 and CLO-5:
Please read the following instructions before attempting to solve this assignment
1. This is an individual assignment. You will submit your work individually through your
logins (course portal) and also submit hard copy.
2. Try to get the concepts, consolidate your concepts and ideas from these questions
3. You should concern recommended books for clarify your concepts as handouts are not
sufficient.

4. Try to make solution by yourself and protect your work from other
students. If I found the solution files of some students are same then
I will reward zero marks to all those students.
5. Deadline for this assignment is December 18,2019. This deadline will not be extended.

FALL 2019 Page 1

Question # 1
Write a C++ program that construct Full Binary Tree from given preorder and postorder traversals
Question # 2
Write a C++ program that convert a given Binary Tree to Doubly Linked List
Question # 3
Write a C++ program that Difference between sums of odd level and even level nodes of a Binary Tree
Question # 4
Write a C++ program that check if a given array represents a Binary Heap
Question # 5
Write a C++ program that print all nodes less than a value x in a Min Heap.
Question # 6
Implement Prim’s and Kruskal Algorithm for finding MST
Question # 7
Write a C++ program for hashing with chaining

Good Luck! Happy coding. ☺

FALL 2019 Page 2