CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-04 19:20:52 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: Replace 结点 with 节点 (#452)

Browse Source 
* Replace 结点 with 节点
Update the footnotes in the figures

* Update mindmap

* Reduce the size of the mindmap.png
This commit is contained in:
Yudong Jin
2023-04-09 04:32:17 +08:00
committed by GitHub
parent 3f4e32b2b0
commit 1c8b7ef559
395 changed files with 2056 additions and 2056 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
codes/zig/chapter_tree/binary_tree.zig
View File

@@ -8,7 +8,7 @@ const inc = @import("include");
// Driver Code
pub fn main() !void {
// 初始化二叉树
// 初始化结点
// 初始化节点
var n1 = inc.TreeNode(i32){ .val = 1 };
var n2 = inc.TreeNode(i32){ .val = 2 };
var n3 = inc.TreeNode(i32){ .val = 3 };
@@ -22,16 +22,16 @@ pub fn main() !void {
std.debug.print("初始化二叉树\n", .{});
try inc.PrintUtil.printTree(&n1, null, false);
// 插入与删除结点
// 插入与删除节点
var p = inc.TreeNode(i32){ .val = 0 };
// 在 n1 -> n2 中间插入结点 P
// 在 n1 -> n2 中间插入节点 P
n1.left = &p;
p.left = &n2;
std.debug.print("插入结点 P 后\n", .{});
std.debug.print("插入节点 P 后\n", .{});
try inc.PrintUtil.printTree(&n1, null, false);
// 删除结点
// 删除节点
n1.left = &n2;
std.debug.print("删除结点 P 后\n", .{});
std.debug.print("删除节点 P 后\n", .{});
try inc.PrintUtil.printTree(&n1, null, false);
_ = try std.io.getStdIn().reader().readByte();