AVL remove need recursive from removeNode #485

tree.insert(9);
tree.insert(5);
tree.insert(12);
tree.insert(3);
tree.insert(7);
tree.insert(11);
tree.insert(13);
tree.insert(2);
tree.insert(4);
tree.insert(6);
tree.insert(8);
tree.insert(10);

expect(tree.toString()).toBe('2,3,4,5,6,7,8,9,10,11,12,13');
expect(tree.toString2()).toBe('9,5,3,2,4,7,6,8,12,11,10,13'); // toString2 is preOrder

tree.insert(1);
expect(tree.toString2()).toBe('9,5,3,2,1,4,7,6,8,12,11,10,13');
tree.insert(0);
expect(tree.toString2()).toBe('9,5,3,1,0,2,4,7,6,8,12,11,10,13');

tree.remove(13);
expect(tree.toString2()).toBe('9,5,3,1,0,2,4,7,6,8,12,11,10'); // now
expect(tree.toString2()).toBe('5,3,1,0,2,4,9,7,6,8,11,10,12'); // correct