algorithm/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2025-07-07 01:44:52 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix naming in binary search tree test.

Browse Source
This commit is contained in:
Oleksii Trekhleb
2018-05-31 06:23:51 +03:00
parent b62d9a43b4
commit c18fd63a53
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/data-structures/tree/binary-search-tree/__test__/BinarySearchTree.test.js
View File

@ -48,7 +48,7 @@ describe('BinarySearchTree', () => {
}); });
it('should insert object values', () => { it('should insert object values', () => {
const nodeValueComparatorCallback = (a, b) => { const nodeValueCompareFunction = (a, b) => {
const normalizedA = a || { value: null }; const normalizedA = a || { value: null };
const normalizedB = b || { value: null }; const normalizedB = b || { value: null };
@ -63,7 +63,7 @@ describe('BinarySearchTree', () => {
const obj2 = { key: 'obj2', value: 2, toString: () => 'obj2' }; const obj2 = { key: 'obj2', value: 2, toString: () => 'obj2' };
const obj3 = { key: 'obj3', value: 3, toString: () => 'obj3' }; const obj3 = { key: 'obj3', value: 3, toString: () => 'obj3' };
const bst = new BinarySearchTree(nodeValueComparatorCallback); const bst = new BinarySearchTree(nodeValueCompareFunction);
bst.insert(obj2); bst.insert(obj2);
bst.insert(obj3); bst.insert(obj3);