查找树的子结构

首先需要再A的子结构中找到B的根节点，然后从这个根节点向下比较

对于二叉树的查找，首选递归的方式，

二叉树的比较也需要用到递归的方式，他们的代码如下

package com.company.offer;

public class Tree {
    static class BinaryTreeNode{
        public BinaryTreeNode(int value){
            this.value = value;
        }
        int value;
        BinaryTreeNode left = null;
        BinaryTreeNode right = null;
    }

    public static void main(String[] args){
        BinaryTreeNode n1 = new BinaryTreeNode(1);
        BinaryTreeNode n2 = new BinaryTreeNode(2);
        BinaryTreeNode n3 = new BinaryTreeNode(3);
        BinaryTreeNode n4 = new BinaryTreeNode(4);
        BinaryTreeNode n5 = new BinaryTreeNode(5);
        BinaryTreeNode n6 = new BinaryTreeNode(6);
        BinaryTreeNode n7 = new BinaryTreeNode(7);
        BinaryTreeNode n8 = new BinaryTreeNode(8);
        BinaryTreeNode n9 = new BinaryTreeNode(9);
        BinaryTreeNode n10 = new BinaryTreeNode(1);
        BinaryTreeNode n11 = new BinaryTreeNode(2);
        BinaryTreeNode n12 = new BinaryTreeNode(102);
        n1.left = n2;
        n1.right = n3;
        n2.left = n4;
        n2.right = n5;
        n3.left = n6;
        n3.right =n7;
        n4.left = n8;
        n4.right = n9;

        n10.left = n11;
//        n10.right = n12;

        boolean subTree = isSubTree(n1,n10);
        System.out.println("包含子节点吗？  = "+subTree);
    }

    /**
     * 首先递归查找出头节点
     * @param n1
     * @param n2
     * @return
     */
    public static boolean isSubTree(BinaryTreeNode n1, BinaryTreeNode n2){
        if(n1 == null && n2 == null) return true;
        if( (n1 == null && n2 != null) || (n1 != null)&& (n2 ==null) ) return false;
        if(n1.value == n2.value){
            if(n2.left== null && n2.right == null) return true;
            if(n2.left == null && n2.right != null) return compareFromRoot(n1.right, n2.right);
            if(n2.left != null && n2.right == null) return compareFromRoot(n1.left,n2.left);
            return compareFromRoot(n1.left,n2.left) && compareFromRoot(n1.right,n2.right);
        } else {
            return isSubTree(n1.left ,n2)||isSubTree(n1.right, n2);
        }
    }

    /**
     * 从根节点开始比较子节点
     * @param n1
     * @param n2
     * @return
     */
    public static boolean compareFromRoot(BinaryTreeNode n1,BinaryTreeNode n2){
        if(n1 == null && n2 == null) return true;
        if( (n1 == null && n2 != null) || (n1 != null)&& (n2 ==null) ) return false;
        if(n1.value == n2.value){
            if(n2.left== null && n2.right == null) return true;
            if(n2.left == null && n2.right != null) return compareFromRoot(n1.right, n2.right);
            if(n2.left != null && n2.right == null) return compareFromRoot(n1.left,n2.left);
            return compareFromRoot(n1.right,n2.right) && compareFromRoot(n1.left,n2.left);
        } else {
            return false;
        }
    }

}