minor cleanup

Author: mourner

README.md

@@ -7,7 +7,9 @@ This repo contains several simple balanced binary search tree JavaScript impleme
 - `bsarray.js`: pseudo-BBST internally stored as a simple JS array
 - `llrb.js`: Sedgewick's [Left-Leaning Red-Black Tree](http://algs4.cs.princeton.edu/33balanced/)
 
-Benchmarks contain comparisons with [functional-red-black-tree](https://github.com/mikolalysenko/functional-red-black-tree) (incredibly, insanely fast, still not sure why) and [js_bintrees](https://github.com/vadimg/js_bintrees).
+Benchmarks contain comparisons with [functional-red-black-tree](https://github.com/mikolalysenko/functional-red-black-tree) and [js_bintrees](https://github.com/vadimg/js_bintrees).
+
+The goal is to create the fastest and at the same time the simplest JS balanced binary search tree library.
 
 Example usage of trees:
 

llrb.js

@@ -1,3 +1,4 @@
+'use strict';
 
 module.exports = llrb;
 
@@ -19,12 +20,12 @@ function Node(key, value, red) {
 
 LLRBTree.prototype = {
     find: function (key) {
-        var x = this.root,
-            compare = this.compare;
-        while (x) {
-            var c = compare(key, x.key);
-            if (c === 0) return x;
-            x = c < 0 ? x.left : x.right;
+        var n = this.root,
+            cmp = this.compare;
+        while (n) {
+            var c = cmp(key, n.key);
+            if (c === 0) return n;
+            n = c < 0 ? n.left : n.right;
         }
         return null;
     },