Maximum Depth of Binary Tree 分类： Leetcode 算法 2014-10-29 21:16 87人阅读 评论(0) 收藏

Maximum Depth of Binary Tree

 Total Accepted: 36406 Total Submissions: 83130

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.

水题

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
      int maxDepth(TreeNode *root) {
          int l,r;
        if(root==NULL) return 0;
        else{ 
            l=maxDepth(root->left)+1;
            r=maxDepth(root->right)+1;
        }
        if(l>r) return l;
        else return r;
        
    }
};

版权声明：本文为博主原创文章，未经博主允许不得转载。