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

main(){
	public int recursive(Treenode root){
		return (root==null?0:(root.left<root.right?:(root.right:root.left)))+1;
	}
}