algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Bug fixes and improvements (#1298)

Browse Source 
* Fix is_empty() implementation in the stack and queue chapter

* Update en/CONTRIBUTING.md

* Remove "剩余" from the state definition of knapsack problem

* Sync zh and zh-hant versions

* Update the stylesheets of code tabs

* Fix quick_sort.rb

* Fix TS code

* Update chapter_paperbook

* Upload the manuscript of 0.1 section

* Fix binary_tree_dfs.rb

* Bug fixes

* Update README

* Update README

* Update README

* Update README.md

* Update README

* Sync zh and zh-hant versions

* Bug fixes
This commit is contained in:
Yudong Jin
2024-04-22 02:26:32 +08:00
committed by GitHub
parent 74f1a63e8c
commit f616dac7da
61 changed files with 1606 additions and 145 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
zh-hant/docs/chapter_tree/binary_tree.md
View File

@ -106,7 +106,7 @@
val: number;
left: TreeNode | null;
right: TreeNode | null;
constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
this.val = val === undefined ? 0 : val; // 節點值
this.left = left === undefined ? null : left; // 左子節點引用
@ -189,7 +189,16 @@
=== "Ruby"
```ruby title=""
### 二元樹節點類別 ###
class TreeNode
attr_accessor :val # 節點值
attr_accessor :left # 左子節點引用
attr_accessor :right # 右子節點引用
def initialize(val)
@val = val
end
end
```
=== "Zig"
@ -432,7 +441,18 @@
=== "Ruby"
```ruby title="binary_tree.rb"
# 初始化二元樹
# 初始化節點
n1 = TreeNode.new(1)
n2 = TreeNode.new(2)
n3 = TreeNode.new(3)
n4 = TreeNode.new(4)
n5 = TreeNode.new(5)
# 構建節點之間的引用（指標）
n1.left = n2
n1.right = n3
n2.left = n4
n2.right = n5
```
=== "Zig"
@ -594,7 +614,13 @@
=== "Ruby"
```ruby title="binary_tree.rb"
# 插入與刪除節點
_p = TreeNode.new(0)
# 在 n1 -> n2 中間插入節點 _p
n1.left = _p
_p.left = n2
# 刪除節點
n1.left = n2
```
=== "Zig"