Using standard maintain, and the delete operation have problems.

lygstate · lygstate · commit 160fdef9e61e · 2015-09-23T11:54:02.000+08:00
diff --git a/src/data-structures/size-balanced-tree.js b/src/data-structures/size-balanced-tree.js
@@ -143,20 +143,46 @@
     return childNode;
   }
 
+  function maintain(node, leftChild) {
+    if (node === Nil) {
+      return node;
+    }
+    var savedNode = node;
+    if (leftChild) {
+      if (node.left.left.size > node.right.size) {
+        node = RightRotate(node, node.left);
+      } else if (node.left.right.size > node.right.size) {
+        LeftRotate(node.left, node.left.right);
+        node = RightRotate(node, node.left);
+      }
+    } else {
+      if (node.right.right.size > node.left.size) {
+        node = LeftRotate(node, node.right);
+      } else if (node.right.left.size > node.left.size) {
+        RightRotate(node.right, node.right.left);
+        node = LeftRotate(node, node.right);
+      }
+    }
+    node.updateSize();
+    if (node === savedNode) {
+      return node;
+    }
+    maintain(node.left, false);
+    maintain(node.right, true);
+    node = maintain(node, true);
+    node = maintain(node, false);
+    return node;
+  }
+
   function maintainSizeBalancedTree(node) {
     while (node.parent !== Nil) {
       let childNode = node;
       node = node.parent;
-      if (node.right === childNode) {
-        if (childNode.right.size > node.left.size) {
-          node = LeftRotate(node, childNode);
-        }
+      if (node.left == childNode) {
+        node = maintain(node, true);
       } else {
-        if (childNode.left.size > node.right.size) {
-          node = RightRotate(node, childNode);
-        }
+        node = maintain(node, false);
       }
-      node.updateSize();
     }
     return node;
   }
diff --git a/test/data-structures/size-balanced-tree.spec.js b/test/data-structures/size-balanced-tree.spec.js
@@ -143,7 +143,7 @@ describe('SBTree', function () {
       expect(node.value).toBe(expectedArray[i]);
     }
     console.log(maxHeight);
-    for (var i = 0; i < 50000; ++i) {
+    for (var i = 0; i < 90000; ++i) {
       var removedPos = getRandomInt(0, sTree.size);
       sTree.remove(removedPos);
       expectedArray.splice(removedPos, 1);

Original file line number	Diff line number	Diff line change
`@@ -143,7 +143,7 @@ describe('SBTree', function () {`
`143`	`143`	`expect(node.value).toBe(expectedArray[i]);`
`144`	`144`	`}`
`145`	`145`	`console.log(maxHeight);`
`146`		`- for (var i = 0; i < 50000; ++i) {`
	`146`	`+ for (var i = 0; i < 90000; ++i) {`
`147`	`147`	`var removedPos = getRandomInt(0, sTree.size);`
`148`	`148`	`sTree.remove(removedPos);`
`149`	`149`	`expectedArray.splice(removedPos, 1);`