From c18fd63a53685f762cf5d84822c8fd5ceeab0e06 Mon Sep 17 00:00:00 2001
From: Oleksii Trekhleb <trehleb@gmail.com>
Date: Thu, 31 May 2018 06:23:51 +0300
Subject: [PATCH] Fix naming in binary search tree test.

---
 .../tree/binary-search-tree/__test__/BinarySearchTree.test.js | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/data-structures/tree/binary-search-tree/__test__/BinarySearchTree.test.js b/src/data-structures/tree/binary-search-tree/__test__/BinarySearchTree.test.js
index af93fc50..9c51c1da 100644
--- a/src/data-structures/tree/binary-search-tree/__test__/BinarySearchTree.test.js
+++ b/src/data-structures/tree/binary-search-tree/__test__/BinarySearchTree.test.js
@@ -48,7 +48,7 @@ describe('BinarySearchTree', () => {
   });
 
   it('should insert object values', () => {
-    const nodeValueComparatorCallback = (a, b) => {
+    const nodeValueCompareFunction = (a, b) => {
       const normalizedA = a || { value: null };
       const normalizedB = b || { value: null };
 
@@ -63,7 +63,7 @@ describe('BinarySearchTree', () => {
     const obj2 = { key: 'obj2', value: 2, toString: () => 'obj2' };
     const obj3 = { key: 'obj3', value: 3, toString: () => 'obj3' };
 
-    const bst = new BinarySearchTree(nodeValueComparatorCallback);
+    const bst = new BinarySearchTree(nodeValueCompareFunction);
 
     bst.insert(obj2);
     bst.insert(obj3);