traverse_tree_nodes_in_js

traverse_tree_nodes_in_js

function node(name, parent) {
 
return {
name:name,
parent:parent
}
 
}
 
root = node('root')
 
n2 = node('left', root)
root.left = n2
 
n3 = node('2left', n2)
n2.left = n3

n4 = node('right', root)
root.right = n4

n5 = node('3left', n3)
n3.left = n5 
 
function size(nodz) {
    if (!nodz) return 0;
    return 1 + size(nodz.left) + size(nodz.right);
}

function max(nodz) {
    if (!nodz) return -1;
    return 1 + Math.max(max(nodz.left), max(nodz.right));
}

function min(nodz) {
    if (!nodz) return -1;
    return 1 + Math.min(min(nodz.left), min(nodz.right));
}
 
 
console.log('\nstart')
console.log(max(root))

if (max(root) > (min(root) + 1)) {
  console.log('not balanced');
}

//console.log(size(root))