src/tree.js
function (node, key) {
  'use strict';
  var i, k;

  if (node.key === key) {
    return node;
  } else {
    for (i = 0; i < node.children.length; i += 1) {
      k = slow_findKey(node.children[i], key);
      if (k) {
        return k;
      }
    }
  }
}
function (node, key) {
  'use strict';
  var i, k;

  if (node.key === key) {
    return node;
  } else {
    for (i = 0; i < node.children.length; i += 1) {
      k = slow_findKey(node.children[i], key);
      if (k) {
        return k;
      }
    }
  }
}
function ( node , key ) { 'use strict' ; var i , k ; if ( node . key === key ) { return node ; } else { for ( i = 0 ; i < node . children . length ; i += 1 ) { k = slow_findKey ( node . children [ i ] , key ) ; if ( k ) { return k ; } } } }
Slow implementation of findKey which checks every node. Useful to understand if the tree has been built incorrectly.
Slow implementation of findKey which checks every node . Useful to understand if the tree has been built incorrectly .