maximum-depth-of-binary-tree.MD

Maximum Depth of Binary Tree @ LeetCode

https://leetcode.com/problems/maximum-depth-of-binary-tree/

---

1st Approach (Recursive)

/**
 * 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 == nullptr) {
            return 0;
        }
        
        return 1 + std::max(maxDepth(root->left), maxDepth(root->right));
    }
};