通过遍历二叉树，求二叉树的深度 使用是先输入各节点的数据，再得出二叉树的深度-By traversing a binary tree, find the depth of use is the first binary input data on each node, and then arrive at the depth of binary tree