mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-27 15:26: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
41 lines
877 B
Python
41 lines
877 B
Python
"""
|
|
File: binary_tree.py
|
|
Created Time: 2022-12-20
|
|
Author: a16su (lpluls001@gmail.com)
|
|
"""
|
|
|
|
import sys
|
|
from pathlib import Path
|
|
|
|
sys.path.append(str(Path(__file__).parent.parent))
|
|
from modules import TreeNode, print_tree
|
|
|
|
|
|
"""Driver Code"""
|
|
if __name__ == "__main__":
|
|
# 初始化二叉树
|
|
# 初始化节点
|
|
n1 = TreeNode(val=1)
|
|
n2 = TreeNode(val=2)
|
|
n3 = TreeNode(val=3)
|
|
n4 = TreeNode(val=4)
|
|
n5 = TreeNode(val=5)
|
|
# 构建节点之间的引用（指针）
|
|
n1.left = n2
|
|
n1.right = n3
|
|
n2.left = n4
|
|
n2.right = n5
|
|
print("\n初始化二叉树\n")
|
|
print_tree(n1)
|
|
|
|
# 插入与删除节点
|
|
P = TreeNode(0)
|
|
# 在 n1 -> n2 中间插入节点 P
|
|
n1.left = P
|
|
P.left = n2
|
|
print("\n插入节点 P 后\n")
|
|
print_tree(n1)
|
|
# 删除节点
|
|
n1.left = n2
|
|
print("\n删除节点 P 后\n")
|
|
print_tree(n1)
|