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.
很简单的一个深度优先搜索的代码...就是找到一颗二叉树的深度..so easy.
/**
* Definition for a binary tree node.
* public class TreeNode {