题意大概是,找两个节点的最低公共祖先
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { if (root == NULL) return NULL; if (root->val > p->val && root->val > q->val) return lowestCommonAncestor(root->left,p,q); if (root->val < p->val && root->val < q->val) return lowestCommonAncestor(root->right,p,q); return root; //出现了一大一小,就可以返回root了 } };
原文地址:https://www.cnblogs.com/sherry-yang/p/8454240.html
时间: 2024-10-07 22:13:05