CS301 Assignment No. 2

Total Marks: 20

Due Date: 03/05/2011

Instructions

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 assignment does NOT open or file corrupt.

o The assignment is copied (from other student or ditto copy from handouts or internet).

Objective

The objective of this assignment is

o To give you some practice exercise of Binary Search Tree (BST) Data Structure.

For any query about the assignment, contact at cs301@vu.edu.pk

Assignment:

Consider the following sequence of numbers: [ 20, 25, 3, 4, 14, 15, 18, 12, 9, 2, 16, 19, 17 ]

• Construct Binary Search Tree (BST) [8 marks]
• Perform In-order, Pre-order and Post-order traversal [6 marks]
• Delete 15 from the above constructed BST [6 marks]