C#实现二叉树的遍历
2017-09-19 21:20
435 查看
C#实现二叉树的前序、中序、后序遍历。
public class BinaryTreeNode { int value; BinaryTreeNode left; BinaryTreeNode right; /// <summary> /// 前序遍历 /// </summary> /// <param name="tree"></param> public static void PreOrder(BinaryTreeNode tree) { if (tree == null) return; System.Console.Write(tree.value + " "); PreOrder(tree.left); PreOrder(tree.right); } /// <summary> /// 前序遍历循环实现 /// </summary> /// <param name="tree"></param> public static void PreOrderLoop(BinaryTreeNode tree) { if (tree == null) return; Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>(); BinaryTreeNode node = tree; while(node != null || stack.Any()){ if(node != null) { stack.Push(node); System.Console.Write(node.value + " "); node = node.left; } else { var item = stack.Pop(); node = item.right; } } } /// <summary> /// 中序遍历 /// </summary> /// <param name="tree"></param> public static void InOrder(BinaryTreeNode tree) { if (tree == null) return; InOrder(tree.left); System.Console.Write(tree.value + " "); InOrder(tree.right); } /// <summary> /// 中序遍历循环实现 /// </summary> /// <param name="tree"></param> public static void InOrderLoop(BinaryTreeNode tree) { if (tree == null) return; Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>(); BinaryTreeNode node = tree; while (node != null || stack.Any()) { if (node != null) { stack.Push(node); node = node.left; } else { var item = stack.Pop(); System.Console.Write(item.value + " "); node = item.right; } } } /// <summary> /// 后序遍历 /// </summary> /// <param name="tree"></param> public static void PostOrder(BinaryTreeNode tree) { if (tree == null) return; PostOrder(tree.left); PostOrder(tree.right); System.Console.Write(tree.value + " "); } /// <summary> /// 后序遍历循环实现1 /// </summary> /// <param name="tree"></param> public static void PostOrderLoop(BinaryTreeNode tree) { if (tree == null) return; Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>(); BinaryTreeNode node = tree; BinaryTreeNode pre = null; stack.Push(node); while (stack.Any()) { node = stack.Peek(); if ((node.left == null && node.right == null) || (pre != null && (pre == node.left || pre == node.right))) { System.Console.Write(node.value + " "); pre = node; stack.Pop(); } else { if (node.right != null) stack.Push(node.right); if (node.left != null) stack.Push(node.left); } } } /// <summary> /// 后续遍历循环实现2 /// </summary> /// <param name="tree"></param> public static void PostOrderLoop2(BinaryTreeNode tree) { HashSet<BinaryTreeNode> visited = new HashSet<BinaryTreeNode>(); Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>(); BinaryTreeNode node = tree; while (node != null || stack.Any()) { if (node != null) { stack.Push(node); node = node.left; } else { var item = stack.Peek(); if (item.right != null && !visited.Contains(item.right)) { node = item.right; } else { System.Console.Write(item.value + " "); visited.Add(item); stack.Pop(); } } } } }
相关文章推荐
- 数据结构:二叉树的建立和遍历(C#实现)
- C#实现二叉树的各种遍历
- C#中实现二叉树的遍历
- C#实现二叉树,外带中序遍历
- C#实现二叉树,外带中序遍历
- 二叉树后续遍历的非递归循环C# 实现
- C#实现二叉树数据结构以及先序、中序、后续遍历
- java实现二叉树及遍历
- 二叉树构建,先序,中序,后序遍历(以及非递归实现),广度优先遍历
- 二叉树的遍历:前序,中序,后序,层序--包括递归和非递归实现
- 利用栈实现的二叉树的先、中、后序遍历
- 二叉树层次遍历队列实现
- 二叉树按层次遍历--队列实现
- java创建二叉树并实现3种遍历(不使用类集)
- 二叉树先序,中序,后序遍历非递归实现
- 二叉树的前序,中序,后序遍历。用递归和非递归实现
- 二叉树创建、遍历、叶结点个数及深度的操作实现
- c# - 二叉树的遍历
- 队列实现二叉树的层序遍历
- 利用栈实现二叉树的先序,中序,后序遍历的非递归操作