From 02d0a06fea37c457c14ff2d3bd097bf3bb26ba1b Mon Sep 17 00:00:00 2001 From: SHEEVOOT Date: Fri, 11 Oct 2019 16:36:47 +0530 Subject: [PATCH 1/4] Added Unit test for BST insert and delete --- .DS_Store | Bin 0 -> 6148 bytes src/.DS_Store | Bin 0 -> 6148 bytes .../BinarySearchTree/BinarySearchTree.test.js | 35 ++++++++++++++++++ 3 files changed, 35 insertions(+) create mode 100644 .DS_Store create mode 100644 src/.DS_Store create mode 100644 src/_DataStructures_/Trees/BinarySearchTree/BinarySearchTree.test.js diff --git a/.DS_Store b/.DS_Store new file mode 100644 index 0000000000000000000000000000000000000000..9a874b5768f336915163bb88cd434575b859f936 GIT binary patch literal 6148 zcmeH~Jr2S!425ml0g0s}V-^m;4I%_5-~tF3k&vj^b9A16778<}(6eNJu~Vz<8=6`~ zboab&MFtUB!i}=AFfm2m$tVxGT*u4pe81nUlA49C} z?O@64YO)2RT{MRe%{!}2F))pG(Sih~)xkgosK7*lF7m<7{{#Hn{6A@7N(HFEpDCdI z{I(FS36RIJd(N1G(djKk}3_ zK5@bBaM>R}PN$}^3Wq4i k#3;vHcsYKKq|9qR=YC%}B?g`GpcC~o;JV19z<(?719CqX-v9sr literal 0 HcmV?d00001 diff --git a/src/_DataStructures_/Trees/BinarySearchTree/BinarySearchTree.test.js b/src/_DataStructures_/Trees/BinarySearchTree/BinarySearchTree.test.js new file mode 100644 index 00000000..0615012e --- /dev/null +++ b/src/_DataStructures_/Trees/BinarySearchTree/BinarySearchTree.test.js @@ -0,0 +1,35 @@ +const BST = require('.'); + +describe('Data Structure : Binary Search Tree', () => { + it('Should be class', () => { + expect(typeof BST.prototype.constructor).toEqual('function'); + }); + + describe('Binary Search Tree API', () => { + let bst = null; + + beforeEach(() => { + bst = new BST(5); + }); + + it('Should insert() element to Binary Search Tree', () => { + bst.add(4); + bst.add(9); + bst.add(2); + bst.insert(bst.root, 3); + expect(bst.traverseInorder()).toEqual([2, 3, 4, 5, 9]); + bst.insert(bst.root, 7); + expect(bst.traverseInorder()).toEqual([2, 3, 4, 5, 7, 9]); + }); + + it('Should delete() an element from Binary Search Tree', () => { + bst.add(4); + bst.add(9); + bst.add(2); + bst.delete(bst.root, 4); + expect(bst.traverseInorder()).toEqual([2, 5, 9]); + bst.delete(bst.root, 2); + expect(bst.traverseInorder()).toEqual([5, 9]); + }); + }); +}); From cae24545bc0f0e27c5df3b4c8ac93e16114bbdd1 Mon Sep 17 00:00:00 2001 From: Mohd Shad Mirza Date: Sat, 12 Oct 2019 10:23:14 +0530 Subject: [PATCH 2/4] Delete .DS_Store --- .DS_Store | Bin 6148 -> 0 bytes 1 file changed, 0 insertions(+), 0 deletions(-) delete mode 100644 .DS_Store diff --git a/.DS_Store b/.DS_Store deleted file mode 100644 index 9a874b5768f336915163bb88cd434575b859f936..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 6148 zcmeH~Jr2S!425ml0g0s}V-^m;4I%_5-~tF3k&vj^b9A16778<}(6eNJu~Vz<8=6`~ zboab&MFtUB!i}=AFfm2m$tVxGT*u4pe81nUlA49C} z?O@64YO)2RT{MRe%{!}2F))pG(Sih~)xkgosK7*lF7m<7{{#Hn{6A@7N(HFEpDCdI z{ Date: Sat, 12 Oct 2019 10:23:32 +0530 Subject: [PATCH 3/4] Delete .DS_Store --- src/.DS_Store | Bin 6148 -> 0 bytes 1 file changed, 0 insertions(+), 0 deletions(-) delete mode 100644 src/.DS_Store diff --git a/src/.DS_Store b/src/.DS_Store deleted file mode 100644 index e82076ef29d81d9dac0241713f633d9ebb0d90a0..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 6148 zcmeHKyKciU3_P|O0(9}%QNPeXFaq}r@&Rd^bPEt5aduDru6|mNkHv611zmz8K%GSK zBI(FS36RIJd(N1G(djKk}3_ zK5@bBaM>R}PN$}^3Wq4i k#3;vHcsYKKq|9qR=YC%}B?g`GpcC~o;JV19z<(?719CqX-v9sr From 2c354b8fda46cd8b9cbe5c15f2dfccc321c1cded Mon Sep 17 00:00:00 2001 From: SHEEVOOT Date: Mon, 14 Oct 2019 10:18:22 +0530 Subject: [PATCH 4/4] delete test removed --- .../Trees/BinarySearchTree/BinarySearchTree.test.js | 10 ---------- 1 file changed, 10 deletions(-) diff --git a/src/_DataStructures_/Trees/BinarySearchTree/BinarySearchTree.test.js b/src/_DataStructures_/Trees/BinarySearchTree/BinarySearchTree.test.js index 0615012e..f467a12e 100644 --- a/src/_DataStructures_/Trees/BinarySearchTree/BinarySearchTree.test.js +++ b/src/_DataStructures_/Trees/BinarySearchTree/BinarySearchTree.test.js @@ -21,15 +21,5 @@ describe('Data Structure : Binary Search Tree', () => { bst.insert(bst.root, 7); expect(bst.traverseInorder()).toEqual([2, 3, 4, 5, 7, 9]); }); - - it('Should delete() an element from Binary Search Tree', () => { - bst.add(4); - bst.add(9); - bst.add(2); - bst.delete(bst.root, 4); - expect(bst.traverseInorder()).toEqual([2, 5, 9]); - bst.delete(bst.root, 2); - expect(bst.traverseInorder()).toEqual([5, 9]); - }); }); });