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.
Subscribe to see which companies asked this question.
这道就是就二叉树的最大深度，用个递归就好，代码如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

int dep(TreeNode*root){
     if(root == NULL) return 0;
     int l = dep(root->left);
     int r = dep(root->right);
     if(l > r) return l+1;
     else return r+1;
 }

class Solution {
public:
    int maxDepth(TreeNode* root) {
        return dep(root);

    }
};