SortingBinaryTree.js

// pre-order sorting

Visit(Node current) {
	if (current == null){
		return;
	}
	Process(current.value);
	Visit(current.Left);
	Visit(current.Right);
}

// in-order sorting

Visit(Node current){
	if (current == null) {
		return;
	}

	Visit(current.Left);
	Process(current.value);
	Visit(current.Right);
}

// post order sorting

Visit(Node current){
	if (current == null) {
		return;
	}

	Visit(current.Left);
	Visit(current.Right);
	Process(current.value);
}