CS2143-2144 Data Structures Spring 2012
Quiz # 4(13 March 2012)
Time 10 Minutes
Max. Marks 10
Name: Reg. No: ___
For the following binary search class, implement the insert and search functions.
class bstree
{
protected:
int *p; // array of values
int *f; // array of flag
unsigned int size;
public:
bstree(unsigned int s)
{ int i;
p = new int [s];
f = new int [s];
size = s;
for (i=0; i<s; ++i)
f[i] = 0;
}
int insert(int v); //insert value v in the BST, and return 1 if it is inserted properly
//otherwise return 0
int search(int v); // search value element v at the proper position in BST. if found
//return the index of the location where it is found. Otherwise,
//return -1
};
Docsity.com
