c++二叉树的层序遍历_C#实现二叉树四种遍历(顺序存储结构)

/****************************************************文件&＃xff1a;BiTree.cs作者&＃xff1a;黄山学院--Li Qingshan邮箱: 2781838262&＃64;qq.com日期&＃xff1a;2020/05/19 12:24 功能&＃xff1a;
*****************************************************/
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;namespace 二叉树_顺序存储
{public class BiTree{public T[] data;private int nextIndex &＃61; 0;public BiTree(int length){data &＃61; new T[length];}public bool Add(T item){if (nextIndex >&＃61; data.Length){return false;}else{data[nextIndex] &＃61; item;nextIndex&＃43;&＃43;;return true;}}//前序遍历public void PreorderTraversal(int number){//当下标越界或者当前元素为&＃39;^&＃39;时此次递归分支终止if (number > data.Length || data[number - 1].Equals(&＃39;^&＃39;)){return;}Console.Write(data[number - 1] &＃43; " ");int leftChildNum &＃61; number * 2;PreorderTraversal(leftChildNum);int rightChildNum &＃61; number * 2 &＃43; 1;PreorderTraversal(rightChildNum);}//中序遍历public void MiddleTraversal(int number){//当下标越界或者当前元素为&＃39;^&＃39;时此次递归分支终止if (number > data.Length || data[number - 1].Equals(&＃39;^&＃39;)){return;}int leftChildNum &＃61; number * 2;MiddleTraversal(leftChildNum);Console.Write(data[number - 1] &＃43; " ");int rightChildNum &＃61; number * 2 &＃43; 1;MiddleTraversal(rightChildNum);}//后序遍历public void PostorderTraversal(int number){//当下标越界或者当前元素为&＃39;^&＃39;时此次递归分支终止if (number > data.Length || data[number - 1].Equals(&＃39;^&＃39;)){return;}int leftChildNum &＃61; number * 2;PostorderTraversal(leftChildNum);int rightChildNum &＃61; number * 2 &＃43; 1;PostorderTraversal(rightChildNum);Console.Write(data[number - 1] &＃43; " ");}//层序遍历public void LayerTraversal(){for (int i &＃61; 0; i }


/****************************************************文件&＃xff1a;Program.cs作者&＃xff1a;黄山学院--Li Qingshan邮箱: 2781838262&＃64;qq.com日期&＃xff1a;2020/05/19 15:49 功能&＃xff1a;
*****************************************************/
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;namespace 二叉树_顺序存储
{class Program{static void Main(string[] args){//完全二叉树//char[] CompleteBinaryTree &＃61; new[] { &＃39;A&＃39;, &＃39;B&＃39;, &＃39;C&＃39;, &＃39;D&＃39;, &＃39;E&＃39;, &＃39;F&＃39;, &＃39;G&＃39;, &＃39;H&＃39;, &＃39;I&＃39;, &＃39;J&＃39; };//满二叉树//char[] FullBinaryTree &＃61; new[] { &＃39;A&＃39;, &＃39;B&＃39;, &＃39;C&＃39;, &＃39;D&＃39;, &＃39;E&＃39;, &＃39;F&＃39;, &＃39;G&＃39;};//普通二叉树char[] NormalBinaryTree &＃61; new[] { &＃39;A&＃39;, &＃39;B&＃39;, &＃39;C&＃39;, &＃39;D&＃39;, &＃39;^&＃39;, &＃39;F&＃39;, &＃39;G&＃39;, &＃39;^&＃39;, &＃39;H&＃39;, &＃39;^&＃39;, &＃39;^&＃39;, &＃39;I&＃39; };BiTree biTree &＃61; new BiTree(NormalBinaryTree.Length);for (int i &＃61; 0; i }