Apply code style

tshemsedinov · tshemsedinov · commit 5144332b22ca · 2024-12-08T23:11:35.000+02:00
diff --git a/JavaScript/1-parent.js b/JavaScript/1-parent.js
@@ -1,8 +1,10 @@
 'use strict';
 
-function Node(parent, data) {
-  this.parent = parent;
-  this.data = data;
+class Node {
+  constructor(parent, data) {
+    this.parent = parent;
+    this.data = data;
+  }
 }
 
 // Usage
diff --git a/JavaScript/2-five.js b/JavaScript/2-five.js
@@ -1,37 +1,41 @@
 'use strict';
 
-function Tree(data) {
-  this.count = 1;
-  this.root = new Node(null, data);
-  this.root.tree = this;
-}
-
-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) {
-      parent.first = this;
+class Node {
+  constructor(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) {
+        parent.first = this;
+      }
+      if (parent.last) {
+        parent.last.next = this;
+        this.prev = parent.last;
+      }
+      parent.last = this;
+      parent.count++;
     }
-    if (parent.last) {
-      parent.last.next = this;
-      this.prev = parent.last;
-    }
-    parent.last = this;
-    parent.count++;
+  }
+
+  add(data) {
+    return new Node(this, data);
   }
 }
 
-Node.prototype.add = function(data) {
-  return new Node(this, data);
-};
+class Tree {
+  constructor(data) {
+    this.count = 1;
+    this.root = new Node(null, data);
+    this.root.tree = this;
+  }
+}
 
 // Usage
 
diff --git a/JavaScript/3-native.js b/JavaScript/3-native.js
@@ -1,10 +1,12 @@
 'use strict';
 
-function Node(parent, name) {
-  this.name = name;
-  if (parent) {
-    this.parent = parent;
-    parent[name] = this;
+class Node {
+  constructor(parent, name) {
+    this.name = name;
+    if (parent) {
+      this.parent = parent;
+      parent[name] = this;
+    }
   }
 }
 
diff --git a/JavaScript/7-bst-over.js b/JavaScript/7-bst-over.js
@@ -10,8 +10,8 @@ tree.insert = (root, data, i = data < root[0] ? 1 : 2) => (
 );
 
 tree.search = (root, data, value = root[0]) => (
-  data === value || !root ? root :
-    tree.search(root[data < value ? 1 : 2], data)
+  data === value || !root ? root
+    : tree.search(root[data < value ? 1 : 2], data)
 );
 
 // Usage
diff --git a/JavaScript/9-bst-ready.js b/JavaScript/9-bst-ready.js
@@ -7,9 +7,9 @@ const TREE_LEFT = 3;
 const TREE_RIGHT = 4;
 
 const tree = (
-  key = null, value = null, parent = null, left = null, right = null
+  key = null, value = null, parent = null, left = null, right = null,
 ) => [
-  key, value, parent, left, right
+  key, value, parent, left, right,
 ];
 
 const data = (node, key, value) => {
@@ -83,7 +83,7 @@ const del = (root, key) => {
 };
 
 Object.assign(tree, {
-  data, parent, left, right, insert, push, search, get, set, del
+  data, parent, left, right, insert, push, search, get, set, del,
 });
 
 // Usage
