mirror of
https://github.com/krahets/hello-algo.git
synced 2025-11-04 22:28:40 +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
38 lines
815 B
Dart
38 lines
815 B
Dart
/**
|
|
* File: binary_tree.dart
|
|
* Created Time: 2023-04-03
|
|
* Author: liuyuxin (gvenusleo@gmail.com)
|
|
*/
|
|
|
|
import '../utils/print_util.dart';
|
|
import '../utils/tree_node.dart';
|
|
|
|
void main() {
|
|
/* 初始化二叉树 */
|
|
// 舒适化节点
|
|
TreeNode n1 = TreeNode(1);
|
|
TreeNode n2 = TreeNode(2);
|
|
TreeNode n3 = TreeNode(3);
|
|
TreeNode n4 = TreeNode(4);
|
|
TreeNode n5 = TreeNode(5);
|
|
// 构建节点之间的引用（指针）
|
|
n1.left = n2;
|
|
n1.right = n3;
|
|
n2.left = n4;
|
|
n2.right = n5;
|
|
print("\n初始化二叉树\n");
|
|
printTree(n1);
|
|
|
|
/* 插入与删除节点 */
|
|
TreeNode p = TreeNode(0);
|
|
// 在 n1 -> n2 中间插入节点 p
|
|
n1.left = p;
|
|
p.left = n2;
|
|
print("\n插入节点 P 后\n");
|
|
printTree(n1);
|
|
// 删除节点 P
|
|
n1.left = n2;
|
|
print("\n删除节点 P 后\n");
|
|
printTree(n1);
|
|
}
|