235. Lowest Common Ancestor of a Binary Search Tree
发布时间:2020-12-14 04:50:15 所属栏目:大数据 来源:网络整理
导读:/* * * 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*
/** * 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 (p->val > q->val) return lowestCommonAncestor(root,q,p); while (root != p && root != q) { if (p->val < root->val && q->val > root->val) return root; else if (p->val > root->val) root = root->right; else root = root->left; } return root; } }; (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |