A simple process to measure the depth of a binary tree, using the recursive method

Coffeescript: Measure Depth of Binary Tree

###
Here is a representation of a simple binary tree,
to illustrate the idea of using a self-calling function
to measure the length of a binary tree.
###

nodeMap = [
  [
		[
			[
				null,
				[
					null,
					[
						null,
						[
							null,
							null
						]
					]
				]
			],
			[
				null,
				null
			]
		],
		[
			null,
			null
		]
	],
	[
		null,
		[
			[
				null,
				null
			],
			null
		]
	]
]

evaluate = (node) ->
	if node == null then return 0
	left = evaluate node[0]
	right = evaluate node[1]
	if left > right then left+1 else right+1

depth = evaluate nodeMap
console.log depth