Maximum Depth of Binary Tree

题目

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.

方法

使用DFS对树进行遍历。也可以理解为后序遍历。

    public int maxDepth(TreeNode root) {        if (root == null) {            return 0;        }        int left = maxDepth(root.left) + 1;        int right = maxDepth(root.right) + 1;        return left > right ? left : right;    }