CS2143-2144 Data Structures Spring 2012
Quiz # 6(26 March 2012)
Time 10 Minutes
Max. Marks 10
Name: Reg. No: ___
For the following binary tree class (not a BST), implement the functions / methods
given in the class.
class btree
{
protected:
int *p; // array of values
int *f; // array of flag
unsigned int size;
public:
btree(unsigned int s)
{ int i;
p = new int [s];
f = new int [s];
size = s;
for (i=0; i<s; ++i)
f[i] = 0;
}
PreOrderVisit (int v) // A function to visit the tree in pre order, starting from
// node with index v,
InOrderVisit (int v) // A function to visit the tree in- In order, starting from node
// with index v,
PostOrderVisit (int v) // A function to visit the tree in post order, starting from
// node with index v,
};
Docsity.com