var nodes = [8,3,10,1,6,14,4,7,13];
var binaryTree = new BinaryTree();
nodes.forEach(function(key){
binaryTree.insert(key);
})
var callback = function(key){
console.log(key)
}
binaryTree.inOrderTraverse(callback);
这是先序输出了