hello-algo/codes/csharp/chapter_tree/binary_tree_dfs.cs

60 lines
1.7 KiB
C#
Raw Normal View History

2022-12-24 16:15:41 +08:00
/**
2023-04-23 19:36:07 +08:00
* File: binary_tree_dfs.cs
2022-12-24 16:15:41 +08:00
* Created Time: 2022-12-23
* Author: haptear (haptear@hotmail.com)
*/
namespace hello_algo.chapter_tree;
public class binary_tree_dfs {
List<int> list = new();
2022-12-24 16:15:41 +08:00
/* 前序遍历 */
void preOrder(TreeNode? root) {
if (root == null) return;
// 访问优先级:根节点 -> 左子树 -> 右子树
list.Add(root.val);
preOrder(root.left);
preOrder(root.right);
}
2022-12-24 16:15:41 +08:00
/* 中序遍历 */
void inOrder(TreeNode? root) {
if (root == null) return;
// 访问优先级:左子树 -> 根节点 -> 右子树
inOrder(root.left);
list.Add(root.val);
inOrder(root.right);
}
2022-12-24 16:15:41 +08:00
/* 后序遍历 */
void postOrder(TreeNode? root) {
if (root == null) return;
// 访问优先级:左子树 -> 右子树 -> 根节点
postOrder(root.left);
postOrder(root.right);
list.Add(root.val);
}
2022-12-24 16:15:41 +08:00
[Test]
public void Test() {
/* 初始化二叉树 */
// 这里借助了一个从数组直接生成二叉树的函数
TreeNode? root = TreeNode.ListToTree(new List<int?> { 1, 2, 3, 4, 5, 6, 7 });
Console.WriteLine("\n初始化二叉树\n");
PrintUtil.PrintTree(root);
2022-12-24 16:15:41 +08:00
list.Clear();
preOrder(root);
Console.WriteLine("\n前序遍历的节点打印序列 = " + string.Join(",", list));
2022-12-24 16:15:41 +08:00
list.Clear();
inOrder(root);
Console.WriteLine("\n中序遍历的节点打印序列 = " + string.Join(",", list));
2022-12-24 16:15:41 +08:00
list.Clear();
postOrder(root);
Console.WriteLine("\n后序遍历的节点打印序列 = " + string.Join(",", list));
2022-12-24 16:15:41 +08:00
}
}