Maximum Depth of Binary Tree

标签：leetcode   算法   

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.

点击打开原题链接

这个题剑指offer里也有，简单的递归即可，代码很清晰：

class Solution 
	{
	public:
		int maxDepth(TreeNode *root) 
		{
			if (root == NULL)
			{
				return 0;
			}
			else
			{
				int a = maxDepth(root->left) + 1;
				int b = maxDepth(root->right) + 1;
				if (a > b)
				{
					return a;
				} 
				else
				{
					return b;
				}
			}
		}
	private:
		//static int depth;
	};

Maximum Depth of Binary Tree

标签：leetcode   算法   

原文地址：http://blog.csdn.net/hongkangwl/article/details/39805567