class Node(){
            Node left;
            Node right;
            int x;
    }

    main(){
            public int recursive(Treenode root){
		int l = recursive(root.left);
		int r = recursive(root.right);
		return (l>r?l:r)+1;
            }
    }