LeetCode:剑指 Offer 55 - I. 二叉树的深度
二刷
遍历树即可
递归返回层数结果
AC Code
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int maxDepth(TreeNode root) {
// 树的遍历
return pre(root, 1);
}
public int pre(TreeNode node, int h){
// 根左右
if(node == null) return h - 1;
// 左右
int a = pre(node.left, h + 1);
int b = pre(node.right, h + 1);
return a > b ? a : b;
}
}