DEV Community

Miss Pooja Anilkumar Patel
Miss Pooja Anilkumar Patel

Posted on

104. Leetcode Solution in cpp

#discuss

==================================================================

Solution: 

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} * }; */ class Solution { public: int maxDepth(TreeNode* root) { if (!root) return 0; return 1 + max(maxDepth(root->left), maxDepth(root->right)); } };
Enter fullscreen mode Exit fullscreen mode

==================================================================

leetcode

challenge

Here is the link for the problem:
https://leetcode.com/problems/maximum-depth-of-binary-tree/

Top comments (0)