# MAXIMUM-DEPTH-OF-BINARY-TREE leetcode Solution - Correct, Optimal and Working

``````/*
*  Author: Arpit Bhayani
*  https://arpitbhayani.me
*/
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <iostream>
#include <list>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>

#define ll long long

#define MIN(a, b) a < b ? a : b
#define MAX(a, b) a > b ? a : b

using namespace std;

int readline(char *str) {
int i = 0;
char ch;
while((ch = getchar()) != '\n') {
str[i++] = ch;
}
str[i] = '\0';
return i;
}

struct node {
int val;
struct node * left;
struct node *right;
};

struct node * new_node(int val) {
struct node *t = (struct node *) malloc(sizeof(struct node));
t->val = val;
t->left = t->right = NULL;
return t;
}

int maxDepth(struct node * root) {
if(root == NULL) {
return 0;
}

int l = maxDepth(root->left);
int r = maxDepth(root->right);

return 1 + ((l > r) ? l : r);
}

int main(int argc, char *argv[]) {
struct node * root = NULL;

root = new_node(1);
root->left = new_node(1);
root->right = new_node(15);
root->right->left = new_node(6);
root->right->right = new_node(20);

printf("%d\n", maxDepth(root));

return 0;
}
``````