fabslab · December 4, 2013 01:59
diff --git a/inOrder.js b/inOrder.js
 // in-order binary tree traversal, returns array containing each node's value
 function inOrder(node) {
  if (node == null) return [];
  return inOrder(node.left).concat([node.value]).concat(inOrder(node.right));
 }
	// in-order binary tree traversal, returns array containing each node's value
	function inOrder(node) {
	if (node == null) return [];
	return inOrder(node.left).concat([node.value]).concat(inOrder(node.right));
	}