From 6f8b7dec67ab9adc2389ec744ae7cd03b43943bf Mon Sep 17 00:00:00 2001 From: balajipachai Date: Fri, 11 Oct 2019 19:40:36 +0530 Subject: [PATCH 1/2] Completed test cases for deletion --- .../BinarySearchTree/bst-deletion.test.js | 37 +++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 src/_DataStructures_/Trees/BinarySearchTree/bst-deletion.test.js diff --git a/src/_DataStructures_/Trees/BinarySearchTree/bst-deletion.test.js b/src/_DataStructures_/Trees/BinarySearchTree/bst-deletion.test.js new file mode 100644 index 00000000..417c2c9b --- /dev/null +++ b/src/_DataStructures_/Trees/BinarySearchTree/bst-deletion.test.js @@ -0,0 +1,37 @@ +const BinarySearchTree = require('./index'); +const heightOfBST = require('./height-of-bst/index'); + +describe('Binary search tree traversals', () => { + let bst; + + describe('Creates BST', () => { + it('should create BST', () => { + // Creates BST + bst = new BinarySearchTree(6); + bst.add(4); + bst.add(9); + bst.add(2); + bst.add(5); + bst.add(8); + bst.add(12); + }); + }); + + describe('BST node deletions', () => { + it('should check height of bst to be 3 prior deletion', () => { + expect(heightOfBST(bst.root)).toEqual(3); + }); + + it('deleting leaf element does not affect tree height if it has sibling', () => { + bst.remove(2); + bst.remove(8); + expect(heightOfBST(bst.root)).toEqual(3); + }); + + it('deleting leaf element does affect tree height if it has no-sibling', () => { + bst.remove(5); + bst.remove(12); + expect(heightOfBST(bst.root)).toEqual(2); + }); + }); +}); From 0d4c1ab14eb857028e2ec7a883bbff73e6ad2708 Mon Sep 17 00:00:00 2001 From: Balaji Pachai Date: Sun, 13 Oct 2019 11:50:26 +0530 Subject: [PATCH 2/2] Added tests to verify tree was created as expected. --- .../Trees/BinarySearchTree/bst-deletion.test.js | 14 ++++++++++++++ 1 file changed, 14 insertions(+) diff --git a/src/_DataStructures_/Trees/BinarySearchTree/bst-deletion.test.js b/src/_DataStructures_/Trees/BinarySearchTree/bst-deletion.test.js index 417c2c9b..2b7f2b3e 100644 --- a/src/_DataStructures_/Trees/BinarySearchTree/bst-deletion.test.js +++ b/src/_DataStructures_/Trees/BinarySearchTree/bst-deletion.test.js @@ -17,6 +17,20 @@ describe('Binary search tree traversals', () => { }); }); + describe('Check bst was created as expected', () => { + it('Inorder traversal of the created bst should be [ 2, 4, 5, 6, 8, 9, 12 ]', () => { + expect(bst.traverseInorder()).toEqual([2, 4, 5, 6, 8, 9, 12]); + }); + + it('Preorder traversal of the created bst should be [ 6, 4, 2, 5, 9, 8, 12 ]', () => { + expect(bst.traversePreorder()).toEqual([6, 4, 2, 5, 9, 8, 12]); + }); + + it('Postorder traversal of the created bst should be [ 2, 5, 4, 8, 12, 9, 6 ]', () => { + expect(bst.traversePostorder()).toEqual([2, 5, 4, 8, 12, 9, 6]); + }); + }); + describe('BST node deletions', () => { it('should check height of bst to be 3 prior deletion', () => { expect(heightOfBST(bst.root)).toEqual(3);