Sheet5 - Faculty of Computers and Information Faculty of...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Faculty of Computers and Information Faculty of Computers and Information Faculty of Computers and Information Faculty of Computers and Information Sheet 5 Department of Computer Science Data Structures Spring 2007 1 Introduction Please implement the data structure BST by writing the file BST.cpp , which includes all of the functions stud- ied in lectures. Make sure that among these functions are the two functions TraverseInorderIterative and TraverseInorderRecursive . For simplicity, choose the ElementType to be float . Hint: you will need to use the linked stack, as well, to implement the iterative function. 2 Main Program The main program has two purposes; the first is to test the basic functions coded in the implementation level. The sec- ond, is to compare the execution time of the two functions TraverseInorderIterative and TraverseInorderRecursive at different sizes of the tree. To achieve these two purposes, please design the program that generates the following menu....
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online