tree

mybells · mybells · commit e76150610477 · 2019-12-16T16:41:40.000+08:00
diff --git a/examples/chapter10/inorder.html b/examples/chapter10/inorder.html
@@ -0,0 +1,10 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="inorder.js"></script>
+</body>
+</html>
diff --git a/examples/chapter10/inorder.js b/examples/chapter10/inorder.js
@@ -0,0 +1,17 @@
+const { Binarysearchtree } = PacktDataStructuresAlgorithms;
+const tree = new Binarysearchtree();
+tree.insert(11);
+tree.insert(7);
+tree.insert(15);
+tree.insert(5);
+tree.insert(3);
+tree.insert(9);
+tree.insert(8);
+tree.insert(10);
+tree.insert(13);
+tree.insert(12);
+tree.insert(14);
+tree.insert(20);
+tree.insert(18);
+tree.insert(25);
+console.log(tree);
diff --git a/examples/chapter10/postorder.html b/examples/chapter10/postorder.html
@@ -0,0 +1,10 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="01-IntroRecursion.js"></script>
+</body>
+</html>
diff --git a/examples/chapter10/postorder.js b/examples/chapter10/postorder.js
@@ -0,0 +1,11 @@
+let i = 0;
+function recursiveFn() {
+  i++;
+  recursiveFn();
+}
+
+try {
+  recursiveFn();
+} catch (ex) {
+  console.log(`i = ${i} error: ${ex}`);
+}
diff --git a/examples/chapter10/preorder.html b/examples/chapter10/preorder.html
@@ -0,0 +1,10 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="04-Fibonacci.js"></script>
+</body>
+</html>
diff --git a/examples/chapter10/preorder.js b/examples/chapter10/preorder.js
@@ -0,0 +1,43 @@
+function fibonacci(n) {
+  if (n < 1) return 0; // {1}
+  if (n <= 2) return 1; // {2}
+  return fibonacci(n - 1) + fibonacci(n - 2); // {3}
+}
+
+console.log('fibonacci(2)', fibonacci(2));
+console.log('fibonacci(3)', fibonacci(3));
+console.log('fibonacci(4)', fibonacci(4));
+console.log('fibonacci(5)', fibonacci(5));
+
+function fibonacciIterative(n) {
+  let fibNMinus2 = 0;
+  let fibNMinus1 = 1;
+  let fibN = n;
+  for (let i = 2; i <= n; i++) { // n >= 2
+    fibN = fibNMinus1 + fibNMinus2; // f(n-1) + f(n-2)
+    fibNMinus2 = fibNMinus1;
+    fibNMinus1 = fibN;
+  }
+  return fibN;
+}
+
+console.log('fibonacciIterative(2)', fibonacciIterative(2));
+console.log('fibonacciIterative(3)', fibonacciIterative(3));
+console.log('fibonacciIterative(4)', fibonacciIterative(4));
+console.log('fibonacciIterative(5)', fibonacciIterative(5));
+
+function fibonacciMemoization(n) {
+  const memo = [0, 1];
+  const fibonacci = (n) => {
+    if (memo[n] != null) return memo[n];
+    return memo[n] = fibonacci(n - 1, memo) + fibonacci(n - 2, memo);
+  };
+  return fibonacci(n);
+}
+
+console.log('fibonacciMemoization(2)', fibonacciMemoization(2));
+console.log('fibonacciMemoization(3)', fibonacciMemoization(3));
+console.log('fibonacciMemoization(4)', fibonacciMemoization(4));
+console.log('fibonacciMemoization(5)', fibonacciMemoization(5));
+
+// https://jsperf.com/fibonacci-comparison-jsbook
diff --git a/examples/index.html b/examples/index.html
@@ -198,6 +198,9 @@
             <div class="page-content mdl-layout--fixed-drawer">
               <div class="mdl-layout__drawer is-visible">
                 <nav class="mdl-navigation">
+                <a class="mdl-navigation__link" href="chapter10/inorder.html">中序遍历  </a>
+                <a class="mdl-navigation__link" href="chapter10/preorder.html">前序遍历  </a>
+                <a class="mdl-navigation__link" href="chapter10/postorder.html">后序遍历  </a>
                 </nav>
               </div>
             </div>
diff --git a/src/js/index.js b/src/js/index.js
@@ -49,6 +49,7 @@ export { default as AVLTree } from './data-structures/avl-tree';
 // chapter 10
 export { MinHeap } from './data-structures/heap';
 export { MaxHeap } from './data-structures/heap';
+// export { default as Binarysearchtree } from './data-structures/binary-search-tree';
 export { default as heapSort } from './algorithms/sorting/heap-sort';
 
 // chapter 11
