CS301 – Data Structures Assignment # 3 May 14. 2010

[Awais]

View more random threads:

• Virtual University of Pakistan 7th convocation
• Eco401 Economics Assignment 2 Deadline 9 July 2010
• CS504 Software Engineering I Assignment 4 Deadline 28 June...
• CS615 Software Project Management Idea Solution Assigment#1...
• MCM501 Advertising for Print and Electronic Media...
• MTH501 Linear Algebra Assignment No.1 Solution Spring...
• ENG201 Business and Technical English Writing Assignment...
• CS001 Computer Proficiency Assignment 1 Spring 2011 Idea...
• FIN621 Financial Statement Analysis Assignment No. 01...
• CS504 Assignment 2 Solution Spring 2010 May 5

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:
13, 3,1,2,4,12,10,5,8,7,6,9,11,14,15,18

Sponsored Links

After making a BST perform the following operations on it.

1. Pre order Traversal 5
2. Inorder Traversal 5
3. Postorder Traversal 5