mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-27 01:06:28 +08:00
e720aa2d24
* Sync recent changes to the revised Word. * Revised the preface chapter * Revised the introduction chapter * Revised the computation complexity chapter * Revised the chapter data structure * Revised the chapter array and linked list * Revised the chapter stack and queue * Revised the chapter hashing * Revised the chapter tree * Revised the chapter heap * Revised the chapter graph * Revised the chapter searching * Reivised the sorting chapter * Revised the divide and conquer chapter * Revised the chapter backtacking * Revised the DP chapter * Revised the greedy chapter * Revised the appendix chapter * Revised the preface chapter doubly * Revised the figures
39 lines
1.1 KiB
Zig
39 lines
1.1 KiB
Zig
// File: binary_tree.zig
|
|
// Created Time: 2023-01-14
|
|
// Author: sjinzh (sjinzh@gmail.com)
|
|
|
|
const std = @import("std");
|
|
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 };
|
|
var n4 = inc.TreeNode(i32){ .val = 4 };
|
|
var n5 = inc.TreeNode(i32){ .val = 5 };
|
|
// 构建节点之间的引用（指针）
|
|
n1.left = &n2;
|
|
n1.right = &n3;
|
|
n2.left = &n4;
|
|
n2.right = &n5;
|
|
std.debug.print("初始化二叉树\n", .{});
|
|
try inc.PrintUtil.printTree(&n1, null, false);
|
|
|
|
// 插入与删除节点
|
|
var p = inc.TreeNode(i32){ .val = 0 };
|
|
// 在 n1 -> n2 中间插入节点 P
|
|
n1.left = &p;
|
|
p.left = &n2;
|
|
std.debug.print("插入节点 P 后\n", .{});
|
|
try inc.PrintUtil.printTree(&n1, null, false);
|
|
// 删除节点
|
|
n1.left = &n2;
|
|
std.debug.print("删除节点 P 后\n", .{});
|
|
try inc.PrintUtil.printTree(&n1, null, false);
|
|
|
|
_ = try std.io.getStdIn().reader().readByte();
|
|
}
|
|
|