Improve examples

tshemsedinov · tshemsedinov · commit ab11024af8dc · 2018-03-21T20:10:21.000+02:00
diff --git a/JavaScript/2-five.js b/JavaScript/2-five.js
@@ -10,10 +10,14 @@ function Node(parent, data) {
   this.data = data;
   this.parent = parent;
   this.count = 0;
+  this.prev = null;
+  this.next = null;
+  this.first = null;
+  this.last = null;
   if (parent) {
     this.tree = parent.tree;
     this.tree.count++;
-    if (parent.count < 1) {
+    if (!parent.count) {
       parent.first = this;
     }
     if (parent.last) {
@@ -23,10 +27,6 @@ function Node(parent, data) {
     parent.last = this;
     parent.count++;
   }
-  this.prev = null;
-  this.next = null;
-  this.first = null;
-  this.last = null;
 }
 
 Node.prototype.add = function(data) {
diff --git a/JavaScript/5-bst.js b/JavaScript/5-bst.js
@@ -33,6 +33,7 @@ tree.insert(root, 9);
 tree.insert(root, 2);
 tree.insert(root, 3);
 tree.insert(root, 1);
+console.dir(root);
 
 const node = tree.search(root, 2);
 console.dir(node, { depth: 3 });
diff --git a/JavaScript/7-bst-over.js b/JavaScript/7-bst-over.js
@@ -14,13 +14,6 @@ tree.search = (root, data, value = root[0]) => (
     tree.search(root[data < value ? 1 : 2], data)
 );
 
-tree.search = (root, data) => {
-  const value = root[0];
-  if (data === value) return root;
-  const next = root[data < value ? 1 : 2];
-  return next ? tree.search(next, data) : null;
-};
-
 // Usage
 
 const root = tree(5);
