zoukankan      html  css  js  c++  java
  • Lowest Common Ancestor of a Binary Search Tree

            _______6______
           /              
        ___2__          ___8__
       /              /      
       0      _4       7       9
             /  
             3   5
    

    For example, the lowest common ancestor (LCA) of nodes 2 and 8 is 6. Another example is LCA of nodes 2 and 4 is 2, since a node can be a descendant of itself according to the LCA definition.

    /**
     * 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 || p == NULL || q == NULL)
            return NULL;
            else if (min(p->val ,q->val)>root->val)
              lowestCommonAncestor( root->right,  p,  q);
            else if (max(p->val ,q->val)<root->val)
              lowestCommonAncestor( root->left,  p,  q);
            else
            return root;
           
        }
    };

  • 相关阅读:
    Redis
    Maven总结
    spring知识点总结
    网上好文搜集整理
    python 代码删除空目录
    plantUML使用指南
    python的基础操作
    八卦基础编程学习
    python历年入坑记录大全
    python实现的百度云自动下载
  • 原文地址:https://www.cnblogs.com/gofighting/p/5036107.html
Copyright © 2011-2022 走看看