Leetcode 104. Maximum Depth of Binary Tree 二叉树的最大高度 解题报告

1 解题思想

这道题就是求解二叉树的最大高度，实在是很简单

一个很简单的DFS式的递归就可以

2 原题

Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

3 AC解

/** * Definition for a binary tree node. * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode(int x) { val = x; } * } */public class Solution {    public int dfs(TreeNode root,int deep){        if(root==null) return deep;        else return Math.max(dfs(root.left,deep + 1),dfs(root.right,deep + 1));    }    public int maxDepth(TreeNode root) {        return dfs(root,0);    }}