#include <iostream>
using namespace std;
class Node {
public:
int data;
Node* left;
Node* right;
Node(int value) {
data = value;
left = NULL;
right = NULL;
}
};
int maxDepth(Node* root) {
if (root == NULL) {
return 0;
}
else {
int leftDepth = maxDepth(root->left);
int rightDepth = maxDepth(root->right);
if (leftDepth > rightDepth) {
return leftDepth + 1;
}
else {
return rightDepth + 1;
}
}
}
int main() {
Node* root = new Node(1);
root->left = new Node(2);
root->right = new Node(3);
root->left->left = new Node(4);
root->left->right = new Node(5);
cout << "Height of the tree is: " << maxDepth(root) << endl;
return 0;
}