mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 15:36:29 +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
40 lines
982 B
Swift
40 lines
982 B
Swift
/**
|
||
* File: binary_tree.swift
|
||
* Created Time: 2023-01-18
|
||
* Author: nuomi1 (nuomi1@qq.com)
|
||
*/
|
||
|
||
import utils
|
||
|
||
@main
|
||
enum BinaryTree {
|
||
/* Driver Code */
|
||
static func main() {
|
||
/* 初始化二叉树 */
|
||
// 初始化节点
|
||
let n1 = TreeNode(x: 1)
|
||
let n2 = TreeNode(x: 2)
|
||
let n3 = TreeNode(x: 3)
|
||
let n4 = TreeNode(x: 4)
|
||
let n5 = TreeNode(x: 5)
|
||
// 构建节点之间的引用（指针）
|
||
n1.left = n2
|
||
n1.right = n3
|
||
n2.left = n4
|
||
n2.right = n5
|
||
print("\n初始化二叉树\n")
|
||
PrintUtil.printTree(root: n1)
|
||
|
||
/* 插入与删除节点 */
|
||
let P = TreeNode(x: 0)
|
||
// 在 n1 -> n2 中间插入节点 P
|
||
n1.left = P
|
||
P.left = n2
|
||
print("\n插入节点 P 后\n")
|
||
PrintUtil.printTree(root: n1)
|
||
// 删除节点 P
|
||
n1.left = n2
|
||
print("\n删除节点 P 后\n")
|
||
PrintUtil.printTree(root: n1)
|
||
}
|
||
}
|