Leetcode 之 Lowest Common Ancestor of a Binary Search Tree
/** * 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) swap(p, q); while (true) { if (q->val < root->val) root = root->left; else if (p->val > root->val) root = root->right; else return root; } return root; } };
posted on 2015-09-18 23:26 Dream_Fish 阅读(319) 评论(0) 编辑 收藏 举报