【Java数据结构】二叉树leetcode经典题目详解，一学就会，一看就懂

⑤二茶树的最大深度

---

public int maxDepth(TreeNode root){

if(root == null){

return 0;

}

int leftHeight = maxDepth(root.left);

int rightHeight = maxDepth(root.right);

return Math.abs(leftHeight-rightHeight > 0? leftHeight + 1: rightHeight + 1);

}

⑥另一颗树的子树

---

public boolean isSameTree(TreeNode p,TreeNode q){

if(p == null && q != null){

return false;

}

if(p != null && q == null){

return false;

}

if(p == null && q ==null){

return true;

}

if(p.val != q.val){

return false;

}

return isSameTree(p.left,q.left) && isSameTree(p.right,q.right);

}

public boolean isSubtree(TreeNode root, TreeNode suBroot){

if(root == null && suBroot == null){

return true;

}

if(isSameTree(root,