@@ -71,20 +71,29 @@ describe('Data Structure : Binary Search Tree', () => {
7171 } ) ;
7272
7373 describe ( 'Check if BST `Is Empty`' , ( ) => {
74- bst = new BinarySearchTree ( 6 ) ;
7574 const keys = [ 4 , 9 , 2 , 5 , 8 , 12 ] ;
76- keys . forEach ( el => bst . add ( el ) ) ;
75+ 76+ beforeEach ( ( ) => {
77+ bst = new BinarySearchTree ( 6 ) ;
78+ keys . forEach ( el => bst . add ( el ) ) ;
79+ } ) ;
80+ 81+ afterEach ( ( ) => {
82+ if ( bst . root ) bst . root = null ;
83+ } ) ;
84+ 7785 it ( 'Should return `false` when BST is not empty' , ( ) => {
7886 expect ( bst . isEmpty ( ) ) . toEqual ( false ) ;
7987 } ) ;
8088
8189 it ( 'Should return `true` when BST is empty' , ( ) => {
82- keys . push ( 6 ) ;
83- keys . forEach ( el => bst . remove ( el ) ) ;
90+ bst . remove ( 6 ) ;
8491 expect ( bst . isEmpty ( ) ) . toEqual ( true ) ;
8592 } ) ;
8693 } ) ;
8794
95+ /*
96+
8897 describe('Find maximum value in BST', () => {
8998 bst = new BinarySearchTree(6);
9099 [4, 9, 2, 5, 8, 12].forEach(el => bst.add(el));
@@ -167,4 +176,5 @@ describe('Data Structure : Binary Search Tree', () => {
167176 expect(postOrderTraversal).toEqual([2, 5, 4, 8, 12, 9, 6]);
168177 });
169178 });
179+ */
170180} ) ;
0 commit comments