: int maxValue(Node *node) {     if (node == nullptr)         throw "BT is empty";      int max = node->data;      if(node->left != nullptr) {         int leftMax = maxValue(node->left);         if(max < leftMax)             max = leftMax;     }      