var array = [17, -4, 24, 100, -67, 33, 11, 20, 51, -350];
var root = {
value: undefined,
left: undefined,
right: undefined,
deep: 0
}
function add(val) {
if (root.value === undefined) {
root.value = val;
return;
}
var currentNode = root;
while (true) {
if (val > currentNode.value) {
if (currentNode.right === undefined) {
currentNode.right = {
value: val,
left: undefined,
right: undefined,
deep: currentNode.deep + 1
}
return currentNode.right;
}
currentNode = currentNode.right;
} else {
if (currentNode.left === undefined) {
currentNode.left = {
value: val,
left: undefined,
right: undefined,
deep: currentNode.deep + 1
}
return currentNode.left;
}
currentNode = currentNode.left;
}
}
}
function printTree() {
var levels = [''];
var currentDeep = 0;
var queue = [root];
while (queue.length > 0) {
var currentNode = queue.shift();
if (currentNode === undefined) {
levels[currentDeep] += 'u ';
continue;
}
currentDeep = currentNode.deep;
if (!levels[currentDeep]) {
levels[currentDeep] = '';
}
levels[currentDeep] += currentNode.value + ' ';
queue.push(currentNode.left);
queue.push(currentNode.right);
}
for (var i = 0; i < levels.length; i++) {
console.log(levels[i]);
}
}
add(array[0]);
for (var i = 1; i < array.length; i++) {
add(array[i]);
}
printTree();