CS301 – Data Structures
Assignment No.3
Mark: 20
Deadline

Your assignment must be uploaded/submitted at or before May 17, 2010

Sponsored Links

Assignment


Question
Consider a binary search tree (BST) that is initially empty. Draw the tree that will result if the following numbers are inserted in the same order given below: 5 Marks

13, 3,1,2,4,12,10,5,8,7,6,9,11,14,15,18

After making a BST perform the following operations on it.

a) Pre order Traversal 5 Marks
b) Inorder Traversal 5 Marks
c) Postorder Traversal 5 Marks