锐客网

  1. 首页 > it技术 > >

========算|Leetcode#236. 二叉树的最近公共祖先

class Solution { public: TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { if(root == NULL || root == p || root == q) return root; TreeNode* l = lowestCommonAncestor(root->left, p, q); TreeNode* r = lowestCommonAncestor(root->right, p, q); if(l && r) return root; if(l) return l; else return r; } };

    推荐阅读


    上一篇：嵌入式系统应用开发——ROS机器人定位导航仿真

    下一篇：leetCode 236. 二叉树的最近公共祖先