Question

(15pt) Assume a Node class with three data members: data, left, and right. Write a recursive method that prints the values of a BST in decreasing order to the stdout. Your method receives a pointer to the root of the tree: void BSTree: print (Node *p)

Answer 1

void BSTree::print(Node *p) {
    if(p != NULL) {
        print(p->right);    // print right subtree
        cout << p->data << " "; // print value at current node
        print(p->left);     // print left subtree
    }
}