236.二叉树最近公共祖先
12345678910111213141516class Solution {public: TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { if(root == NULL) return NULL; if(root == p || root == q) return root; //返回p或q,只要发现一个就返回 TreeNode* left = lowestCommonAncestor(root->left, p, q); TreeNode* right = lowestCommonAncestor(root->right, p, q); if(left == NULL) return right; if(right == NULL) return left; if(lef ...
