tree visiting algorithms

tree_roadtrip.js

function Node (name) {
	this.name = name;
	this.children = [];
}

function Tree (node) {
	this.node = node;
	
	this.visit = function(fn) {
		return fn(this.node);
	}
}

var preOrder = (node) => [].concat.apply([node.name], node.children.map(preOrder));

var postOrder = (node) => [].concat.apply([], node.children.map(postOrder)).concat([node.name]);

var r = new Node('R'),
	m = new Node('M'),
	n = new Node('N'),
	a = new Node('A'),
	b = new Node('B'),
	t = new Node('T'),
	o = new Node('O'),
	p = new Node('P'),
	q = new Node('Q');

r.children = [m, n];

m.children = [a, b];
a.children = [t];

n.children = [o,p, q];

var tree = new Tree(r);

console.log("preOrder:", tree.visit(preOrder));
console.log("postOrder:", tree.visit(postOrder));