Practice Questions-Lab3

Practice Questions-Lab3 - traversal) Q2. Please complete...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Practice Questions – Lab Exam 3 NOTE: Some structure of code will be given like lab exam 2 Q1. Please use the given code to demonstrate the feature of a binary search tree. All the functions should be clearly implemented and tested by main. The Binary Search Tree has the following features: 1. Construct an empty BST 2. Determine if BST is empty 3. Search BST for given item 4. Insert a new item in the BST 5. Delete an item from the BST 6. Display the values of BST in ascending order (inorder
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: traversal) Q2. Please complete the given code to solve a Hanoi Tower problem. Take 4 towers as example and output how the problem is solved. Q3. For the following, write a function for a two-dimensional vector of int that returns the value asked for. 1. The sum of values in a given row 2. The sum of values in a given column 3. The average of the values in a given row...
View Full Document

This note was uploaded on 03/21/2011 for the course CMPE 126 at San Jose State University .

Page1 / 2

Practice Questions-Lab3 - traversal) Q2. Please complete...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online