标签：des style blog color io ar for sp div
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.
此题是经典的求二叉树深度深度题目，可采用递归的方式，以此求每个节点的左子树深度和右子树深度，然后返回该节点左右子树深度最大的那个即为该节点的深度
具体代码如下：
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 == NULL) 14 return 0; 15 16 int nleft = maxDepth(root->left); 17 int nright = maxDepth(root->right); 18 19 return (nleft > nright) ? (nleft+1) : (nright+1); 20 } 21 };
Maximum Depth of Binary Tree 二叉树的深度
标签：des style blog color io ar for sp div
原文地址：http://www.cnblogs.com/fanchangfa/p/4041612.html
