标签：down bsp code block lock nod path 二叉树的深度 find
Problem:
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.
Summary:
求二叉树的深度。
View Code
LeetCode 104 Maximum Depth of Binary Tree
标签：down bsp code block lock nod path 二叉树的深度 find
原文地址：http://www.cnblogs.com/VickyWang/p/5988910.html
