2016年4月21日百度笔试题--SubBinaryTree

public class SubBinaryTree {
      // METHOD SIGNATURE BEGINS, THIS METHOD IS REQUIRED
      public static int isSubTree(TNode root1,TNode root2)
      {
        // INSERT YOUR CODE HERE
          int res=-1;
          if (isequele(root1, root2)) {
            return 1;
        }else if((root1.left!=null&&isequele(root1.left, root2))||(root1.right!=null&&isequele(root1.right, root2))){
            return 1;
        }     
          return res;

      }
      public static boolean isequele(TNode root1,TNode root2){
          if (root1==null&&root2==null) {
            return true;
        }else {
            if (root1!=null&&root2!=null&&root1.value==root2.value&&isequele(root1.left, root2.left)&&isequele(root1.right, root2.right)) {
                return true;
            }
        }     
          return false;
      }
      // METHOD SIGNATURE ENDS
    public class TNode{
        public int value;
        public TNode left;
        public TNode right; 
    }
}