text: class Solution {
   public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
      if (root->val > max(p->val, q->val))
        return lowestCommonAncestor(root->left, p, q);
      if (root->val < min(p->val, q->val))
        return lowestCommonAncestor(root->right, p, q);
      return root;
    }
  };
  