dir structure change

Author: LukeLin

BinaryTree/EBTNode.js

@@ -9,7 +9,7 @@ var PATHS = {
         'dist/Binary tree/*.js',
         'dist/Queue/*.js',
         'dist/Stack/*.js',
-        'Binary tree/BinaryTree-spec.js'
+        './src/BinaryTree/BinaryTree-spec.js'
     ]
 };
 

karma.conf.js

@@ -4,8 +4,8 @@
   "description": "data structure",
   "main": "index.js",
   "scripts": {
-    "build": "set NODE_ENV=production&&webpack",
-    "build:dev": "set NODE_ENV=development&&webpack",
+    "build": "set NODE_ENV=production&&webpack --progress --colors",
+    "build:dev": "set NODE_ENV=development&&webpack --progress --colors",
     "test": "echo \"Error: no test specified\" && exit 1"
   },
   "repository": {

package.json

@@ -10,18 +10,18 @@
 
 // 稀疏矩阵的十字链表存储表示
 class OLNode {
-    constructor(i, j, e) {
+    constructor(i = 0, j = 0, e) {
         // 该非零元的行和列下标
-        this.i = i || 0;
-        this.j = j || 0;
+        this.i = i;
+        this.j = j;
         this.e = e;
         // 该非零元所在行表和列表的后继链域
         this.right = null;  // type: OLNode
         this.down = null;   // type: OLNode
     }
 }
 
-class CrossList {
+export default class CrossList {
     constructor() {
         // 行和列链表头指针向量基址由CreateSMatrix分配
         this.rhead = [];

Array/CrossList.js src/Array/CrossList.js

@@ -11,7 +11,7 @@ class Triple {
     }
 }
 
-class TSMatrix {
+export class TSMatrix {
     constructor(mu, nu) {
         // 非零元三元组表
         this.data = [];
@@ -124,7 +124,7 @@ console.log(matrix.fastTransposeSMatrix());
  * 为此可将快速转置矩阵的算法中创建的，指示“行”信息的辅助数组cpot固定在稀疏矩阵的存储结构中。
  * 称这种“带行链接信息”的三元组表为行逻辑链接的顺序表
  */
-class RLSMatrix extends TSMatrix {
+export class RLSMatrix extends TSMatrix {
     constructor(){
         super(...arguments);
         this.rpos = [0];

Array/TSMatrix.js src/Array/TSMatrix.js

@@ -36,7 +36,7 @@
 const LINK = 0;
 const THREAD = 1;
 
-export class BinaryThreadTree_inOrder {
+export default class BinaryThreadTree_inOrder {
     // 二叉树中序线索化
     static inOrderThreading(tree) {
         var threadTree = new this.constructor();

Array/algorithms.js src/Array/algorithms.js

@@ -0,0 +1,30 @@
+// 有mark域和双亲指针域的二叉树结点类型
+export default class EBTNode {
+    constructor() {
+        this.data = null;
+        this.leftChild = null;
+        this.rightChild = null;
+        this.parent = null;
+        this.mark = 0;
+    }
+
+    postOrder_nonrecursive_nonstack(visit) {
+        var p = this;
+        while (p) {
+            switch (p.mark) {
+                case 0:
+                    p.mark = 1;
+                    if (p.leftChild) p = p.leftChild;
+                    break;
+                case 1:
+                    p.mark = 2;
+                    if (p.rightChild) p = p.rightChild;
+                    break;
+                case 2:
+                    p.data && visit(p.data);
+                    p.mark = 0; // 恢复mark域
+                    p = p.parent;   // 返回双亲结点
+            }
+        }
+    }
+}

BinaryTree/BinaryThreadTree.js src/BinaryTree/BinaryThreadTree.js

@@ -42,17 +42,6 @@ export function huffManCoding(weights) {
     return [huffmanTree, hc];
 }
 
-function huffManCoding2(weights) {
-    let n = weights.length;
-    if (n < 1) return;
-
-    let huffmanTree = buildHuffmanTree(weights, n);
-
-    // 从叶子到根逆向求每个字符的赫夫曼编码
-    let hc = calcHuffmanCode2(huffmanTree, n);
-
-    return [huffmanTree, hc];
-}
 
 function calcHuffmanCode(huffmanTree, n) {
     // 从叶子到根逆向求每个字符的赫夫曼编码
@@ -71,63 +60,20 @@ function calcHuffmanCode(huffmanTree, n) {
     return hc;
 }
 
-// 无栈非递归遍历赫夫曼树
-// todo 该算法有问题
-function calcHuffmanCode2(huffmanTree, n) {
-    let p = 2 * n - 2;
-    let hc = [];
-    let cd = [];
-    let cdLen = 0;
-
-    // 遍历赫夫曼树时用作结点状态标识
-    for (let i = 0; i <= p; i++) huffmanTree[i].weight = 0;
-
-    while (p) {
-        // 向左
-        if (huffmanTree[p].weight === 0) {
-            huffmanTree[p].weight = 1;
-            if (huffmanTree[p].leftChild !== 0) {
-                p = huffmanTree[p].leftChild;
-                cd[cdLen++] = '0';
-            }
-            // 登记叶子结点的字符的编码
-            else if (huffmanTree[p].rightChild === 0) {
-                hc[p - 1] = cd.join('');
-            }
-        }
-        // 向右
-        else if (huffmanTree[p].weight === 1) {
-            huffmanTree[p].weight = 2;
-            if (huffmanTree[p].rightChild !== 0) {
-                p = huffmanTree[p].rightChild;
-                cd[cdLen++] = '1';
-            }
-        }
-        // huffmanTree[p].weight == 2，退回
-        // 退到父节点，编码长度减一
-        else {
-            huffmanTree[p].weight = 0;
-            p = huffmanTree[p].parent;
-            --cdLen;
-        }
-    }
-
-    return hc;
-}
-
 // 创建一棵叶子结点数为n的Huffman树
 function buildHuffmanTree(weights, n) {
     n = n || weights.length;
     let m = 2 * n - 1;
     let huffmanTree = [];
 
     // 初始化
-    for (let i = 0; i < n; i++)
+    let i;
+    for (i = 0; i < n; i++)
         huffmanTree[i] = new HuffmanNode(weights[i], 0, 0, 0);
     for (; i < m; i++)
         huffmanTree[i] = new HuffmanNode(0, 0, 0, 0);
 
-    for (i = n; i < m; i++) {
+    for (let i = n; i < m; i++) {
         // 在HT[1..i-1]选择parent为0且weight最小的两个结点，返回其序号为[s1, s2]
         let ret = select(huffmanTree, i);
         let s1 = ret[0];
@@ -177,7 +123,4 @@ function select(huffmanTree, len) {
 }
 
 console.log('-------huffman coding 1:------');
-console.log(huffManCoding([5, 29, 7, 8, 14, 23, 3, 11]));
-
-console.log('\n-------huffman coding 2:------');
-console.log(huffManCoding2([5, 29, 7, 8, 14, 23, 3, 11]));
+console.log(huffManCoding([5, 29, 7, 8, 14, 23, 3, 11]));