We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 6f8b7de commit 0d4c1abCopy full SHA for 0d4c1ab
src/_DataStructures_/Trees/BinarySearchTree/bst-deletion.test.js
@@ -17,6 +17,20 @@ describe('Binary search tree traversals', () => {
17
});
18
19
20
+ describe('Check bst was created as expected', () => {
21
+ it('Inorder traversal of the created bst should be [ 2, 4, 5, 6, 8, 9, 12 ]', () => {
22
+ expect(bst.traverseInorder()).toEqual([2, 4, 5, 6, 8, 9, 12]);
23
+ });
24
+
25
+ it('Preorder traversal of the created bst should be [ 6, 4, 2, 5, 9, 8, 12 ]', () => {
26
+ expect(bst.traversePreorder()).toEqual([6, 4, 2, 5, 9, 8, 12]);
27
28
29
+ it('Postorder traversal of the created bst should be [ 2, 5, 4, 8, 12, 9, 6 ]', () => {
30
+ expect(bst.traversePostorder()).toEqual([2, 5, 4, 8, 12, 9, 6]);
31
32
33
34
describe('BST node deletions', () => {
35
it('should check height of bst to be 3 prior deletion', () => {
36
expect(heightOfBST(bst.root)).toEqual(3);
0 commit comments