牛客刷题二叉树（二）

目录

1.判断是不是完全二叉树

2. 判断是不是平衡二叉树

3.二叉搜索树的最近公共祖先

---

1.判断是不是完全二叉树

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @return bool布尔型
     */
    public boolean isCompleteTree (TreeNode root) {
        // write code here
        if(root==null) return true;
        List<TreeNode> nodelist=new LinkedList<>();
        nodelist.add(root);
        while(nodelist.size()!=0){
            TreeNode temp=nodelist.get(0);
            nodelist.remove(0);
            if(temp!=null){
                nodelist.add(temp.left);
                nodelist.add(temp.right);
            }else{
                while(nodelist.size()!=0){
                    TreeNode ndoe=nodelist.get(0);
                    nodelist.remove(0);
                    if(ndoe!=null) return false;
                }
            }
        }
        return true;
    }
}

2. 判断是不是平衡二叉树

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param pRoot TreeNode类 
     * @return bool布尔型
     */
    public int deepth(TreeNode root){
        if(root==null) return 0;
        int left=deepth(root.left);
        int right=deepth(root.right);
        return (left>right)?left+1:right+1;
    }
    public boolean IsBalanced_Solution (TreeNode pRoot) {
        // write code here
        if(pRoot==null) return true;
        int left=deepth(pRoot.left);
        int right=deepth(pRoot.right);
        if((left-right)>1 || (left-right)<-1){
            return false;
        }else{
            return IsBalanced_Solution(pRoot.right) && IsBalanced_Solution(pRoot.left);
        }
    }
}

3.二叉搜索树的最近公共祖先

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @param p int整型 
     * @param q int整型 
     * @return int整型
     */
    public int lowestCommonAncestor (TreeNode root, int p, int q) {
        // write code here
        int minV=Math.min(p,q);
        int maxV=Math.max(p,q);
        if(root.val==minV){
            return root.val;
        }
        if(root.val==maxV){
            return root.val;
        }
        if(root.val>minV && root.val<maxV){
            return root.val;
        }else if(minV<root.val && maxV<root.val){
            return lowestCommonAncestor(root.left,p,q);
        }else{
            return lowestCommonAncestor(root.right,p,q);
        }
    }
}