Question

In C++ write a structure for a binary search tree that stores integers. Then, write the root pointer for the tree as its only argument. The function should return the height of the tree.

Answer 1

struct node {
    int data;
    node *left;
    node *right;
};

int height(node *root) {
    if (root == NULL) {
        return -1;
    } else {
        int l = height(root->left);
        int r = height(root->right);
        if (l > r) {
            return l+1;
        } else {
            return r+1;
        }
    }
}