#include <iostream>

using namespace std;

struct treeNode {
    treeNode* left;
    treeNode* right;
    char val;
    treeNode(int x) : val(x), left(NULL), right(NULL) {}
};
int maxDepth = 0;

void traverse(treeNode* node, int depth){
    if(node == NULL)
        return;
    depth++;
    if(depth > maxDepth)
        maxDepth = depth;


    traverse(node->left, depth);
    traverse(node->right, depth);
}

int main(){

    treeNode* head = new treeNode('F');
    treeNode* temp = head;

    temp->left = new treeNode('B');
    temp = temp->left;
    temp->left = new treeNode('A');
    temp->right = new treeNode('D');
    temp = temp->right;

    temp->left = new treeNode('C');
    temp->right = new treeNode('E');

    temp = head;
    temp->right = new treeNode('G');
    temp = temp->right;
    temp->right = new treeNode('I');
    temp->right->left = new treeNode('H');
    temp->right->left->right = new treeNode('J');

    traverse(head, 0);

    cout << maxDepth;

    return 0;
}