230th Commit

README.md

@@ -37,7 +37,7 @@ $ pnpm test twoSum.test.ts
 - [堆疊 (Stack)](./algorithms/stack/README.md)
 - [佇列 (Queue)](./algorithms/queue/README.md)
 - [雜湊表 (Hash Table)](./algorithms/hash-table/README.md)
-- 樹 (Tree)
+- [樹 (Tree)](./algorithms/tree/README.md)
 - [堆積 (Heap)](./algorithms/heap/README.md)
 - [圖 (Graph)](./algorithms/graph/README.md)
 - 字典樹 (Trie)

algorithms/heap/README.md

@@ -4,6 +4,20 @@
 
 父節點的值總是小於或等於其子節點的值。
 
+```ts
+[1, 3, 6, 5, 9, 8, 15];
+```
+
+```mermaid
+graph TD
+    0[1] --> 1[3]
+    0 --> 2[6]
+    1 --> 3[5]
+    1 --> 4[9]
+    2 --> 5[8]
+    2 --> 6[15]
+```
+
 ```ts
 type Comparator<T> = (a: T, b: T) => number;
 
@@ -31,6 +45,20 @@ const minHeap = new Heap<number>(Heap.minComparator);
 
 父節點的值總是大於或等於其子節點的值。
 
+```ts
+[15, 9, 8, 1, 3, 6, 5];
+```
+
+```mermaid
+graph TD
+    0[15] --> 1[9]
+    0 --> 2[8]
+    1 --> 3[1]
+    1 --> 4[3]
+    2 --> 5[6]
+    2 --> 6[5]
+```
+
 ```ts
 type Comparator<T> = (a: T, b: T) => number;
 
@@ -47,9 +75,22 @@ class Heap<T> {
     if (b < a) return -1;
     return 0;
   }
+
+  // 元素入堆積
+  push(value: T): void {
+    //
+  }
 }
 ```
 
 ```ts
 const maxHeap = new Heap<number>(Heap.maxComparator);
+
+maxHeap.push(15);
+maxHeap.push(9);
+maxHeap.push(8);
+maxHeap.push(1);
+maxHeap.push(3);
+maxHeap.push(6);
+maxHeap.push(5);
 ```

algorithms/tree/README.md

@@ -0,0 +1,21 @@
+# 樹 (Tree)
+
+## 二元樹 (Binary Tree)
+
+```ts
+class TreeNode<T> {
+  val: T;
+  left: TreeNode<T> | null;
+  right: TreeNode<T> | null;
+
+  constructor(val: T, left: TreeNode<T> | null = null, right: TreeNode<T> | null = null) {
+    this.val = val;
+    this.left = left;
+    this.right = right;
+  }
+}
+```
+
+```ts
+const n1 = new TreeNode(1);
+```