104-maximum_depth_of_binary_tree.cpp

    /**
 * Author: Mahmoud Gadallah
 * LeetCode Account: https://leetcode.com/m7moudGadallah/
*/
#include<bits/stdc++.h>

using namespace std;


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) {}
};

//Explanation: https://leetcode.com/problems/maximum-depth-of-binary-tree/solutions/3192063/simple-c-solution/
class Solution {
public:
    int maxDepth(TreeNode* root) {
        if (!root)      return 0;
        return 1 + max(maxDepth(root->left), maxDepth(root->right));
    }
};