Cacher is the code snippet organizer for pro developers

/**
 * 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 == p || root == q ) return root;
        
        while(true) {
            if (root->val >= p->val && root->val <= q->val || root->val >= q->val && root->val <= p->val) {
                return root;
            } else if (root->val < p->val && root->val < q->val) {
                root = root->right;
            } else {
                root = root->left;
            }
        }
    }
};