Assignment No. 03
SEMESTER Spring 2013
CS301‐ Data Structures
Please read the following instructions carefully before solving & submitting assignment:
It should be clear that your assignment will not get any credit (zero marks) if:
o The assignment is submitted after due date.
o The submitted code does NOT compile.
o The submitted assignment is other than .CPP file.
o The submitted assignment does NOT open or file is corrupted.
o The assignment is copied (copied from other student or copied from handouts or internet).
Total Marks: 20
Due Date: 15/5/2013
You are required to Upload/Submit only ONE .CPP file.
Don’t wait for grace day. Grace day is only given if there is problem on due date. Submit your solution within
Note that no assignment will be accepted through email if there is any problem on grace day.
Note: Use ONLY Dev‐C++ IDE.
The objective of this assignment is
o To make you familiar with different operations related to BST(binary search tree)
For any query about the assignment, contact at email@example.com
Write a C++ program to.
1) Create a binary search tree named left tree and show the inorder, preorder and postorder traversal of that
left BST tree.
2) Similarly, create a binary search tree named right tree and show the inorder, preorder and postorder
traversal of that right BST tree.
3) After creating left and right binary search trees, one by one pick up a node value from right binary
search tree by any traversing method and then insert that value (which you picked up from right tree node)
in left binary search tree. Discard any duplicate value (in both right and left binary search trees) during
insertion of a value from right binary search tree to left binary search tree.
4) The left binary search tree will be modified after inserting values from right binary search tree. Show the
inorder, preorder and postorder traversal of that modified left binary search tree.
Please watch the attached demo.wmv video for complete details of what is required from you in this 3
assignment. The diagram given below is showing the pictorial representation of left binary search tree , right
binary search tree and the modified left binary search tree which is developed after inserting values into left
binary search tree from right binary search tree.
Left Binary Search Tree:
10 12 20
19 23 25
Right Binary Search Tree:
64 14 20
Modified left binary search tree:
10 12 20 24
1. First understand the code given in handouts about binary search tree.
2. You can use code give handouts to complete desired task.
3. For clearly understanding of assignment task see demo.wmv file attached with assignment file.
4. If you have any ambiguity about assignment send your query at firstname.lastname@example.org.
Lectures Covered: This assignment covers Lecture # 10 to 15
Deadline: Your assignment must be uploaded / submitted on / before, Wednesday May 15, 2013.
in sbhi coding mn aik same error arha hy
Coz ye aik hi code bar bar repeate ho rha hai....different names say..
oyeeeeeeeeeee saray choro.....jo b kr lo any 0 he hi............geo k new channel khani ka theam bht acha chalo wo sunty hein
yar ye zero anay wala bara masla hai
sai but thr iz sol. for nt to hve zero
try tht u wil nt have 0
and what is that solution ???
Mera ek mashwara hai kay aaj jab time expire hoo jaye tou yeh post delete kr di jaye puri ki puri phir sir ko pata hi nai chalay ga kay kahan se copy weger kiya hum ne yaa kahan se solution ka idea liya
nice idea sir ...
correct progrm kn sa ha in sb mn sy plz koi bta dy........... abi lit i ha........... almost 30 mn lft plz hlp me
koi toh cmplt solutn upload kr dy n correct b plZzZzZz....
kuch nhi honay wala. kar k daikh lo. ye student mistake ha. apko time pa kam karna chayea tha. yehi kehna instructor nay.
all students get zero marks