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.
二话不说,递归求解,一次通过。
public int maxDepth(TreeNode root) {
if (root == null)
return 0;
if (root.left == null && root.right == null)