js实现平衡二叉树

var num = 15;
var nodeList = Array.apply(null, Array(num)).map((x, i) => i);
var nodeMap = null;
for (let i of nodeList) {
nodeMap = insert(nodeMap, i);
}

console.log(nodeMap);

function height(N) {
if (N == null)
return 0;
return N.height;
}

function max(a, b) {
return (a > b) ? a : b;
}

function getBalance(N) {
if (N == null)
return 0;
return height(N.left) - height(N.right);
}

function newNode(key) {
let node = {
key: key,
left: null,
right: null,
height: 1,
}
return node;
}

function ll_rotate(y) {
let x = y.left;
y.left = x.right;
x.right = y;

y.height = max(height(y.left), height(y.right)) + 1;
x.height = max(height(x.left), height(x.right)) + 1;

return x;

}

function rr_rotate(y)
{
x = y.right;
y.right = x.left;
x.left = y;

y.height = max(height(y.left), height(y.right)) + 1;
x.height = max(height(x.left), height(x.right)) + 1;

return x;

}

function insert(node, key) {
if (node == null)
return newNode(key);

if (key < node.key) {
  node.left = insert(node.left, key);
}
else if (key > node.key) {
  node.right = insert(node.right, key);
}
else {
  return node;
}

node.height = 1 + max(height(node.left), height(node.right));

let balance = getBalance(node);

if (balance > 1 && key < node.left.key) 
  return ll_rotate(node);


if (balance < -1 && key > node.right.key) 
  return rr_rotate(node);


if (balance > 1 && key > node.left.key) 
{
  node.left = rr_rotate(node.left);
  return ll_rotate(node);
}

if (balance < -1 && key < node.right.key)
{
  node.right = ll_rotate(node.right);
  return rr_rotate(node);
}

// console.log(node);

return node;

}