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.

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) {} * }; */class Solution {public:    int maxDepth(TreeNode* root) {        if(!root)          return 0;        int ldepth,rdepth;        if(root){         ldepth = maxDepth(root->left);         rdepth = maxDepth(root->right);         }        return ldepth>rdepth?ldepth+1:rdepth+1;    }};