mirror of
https://github.com/krahets/hello-algo.git
synced 2026-11-13 09:18:09 +08:00
14c314c08c
* Retranslate the complete English edition from Simplified Chinese * Polish three English explanations after reader-focused review
41 lines
1.0 KiB
Swift
41 lines
1.0 KiB
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() {
|
|
/* Initialize the binary tree */
|
|
// Initialize the nodes
|
|
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)
|
|
// Set up references (pointers) between the nodes
|
|
n1.left = n2
|
|
n1.right = n3
|
|
n2.left = n4
|
|
n2.right = n5
|
|
print("\nInitialize the binary tree\n")
|
|
PrintUtil.printTree(root: n1)
|
|
|
|
/* Insert and remove nodes */
|
|
let P = TreeNode(x: 0)
|
|
// Insert node P between n1 and n2 in n1 -> n2
|
|
n1.left = P
|
|
P.left = n2
|
|
print("\nAfter inserting node P:\n")
|
|
PrintUtil.printTree(root: n1)
|
|
// Remove node P
|
|
n1.left = n2
|
|
print("\nAfter removing node P:\n")
|
|
PrintUtil.printTree(root: n1)
|
|
}
|
|
}
|