标签：des style blog http color io strong for ar
LeetCode: Maximum Depth of Binary Tree
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.
地址：https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/
算法：直接递归，一遍通过。代码：
1 /**
2 * Definition for binary tree
3 * struct TreeNode {
4 * int val;
5 * TreeNode *left;
6 * TreeNode *right;
7 * TreeNode(int x) : val(x), left(NULL), right(NULL) {}
8 * };
9 */
10 class Solution {
11 public:
12 int maxDepth(TreeNode *root) {
13 if(!root) return 0;
14 int left = maxDepth(root->left);
15 int right = maxDepth(root->right);
16 return left > right? left + 1 : right + 1;
17 }
18 };
LeetCode: Maximum Depth of Binary Tree
标签：des style blog http color io strong for ar
原文地址：http://www.cnblogs.com/boostable/p/leetcode_maximum_depth_of_binary_tree.html
