实验五二叉树的基本操作和应用实验报告.docx

重庆大学学生上机实验报告上机课程名称：数据结构上机实验名称：实验5 实验名称 二叉树的基本操作和应用 开课学院及实验室：经济与工商管理学院 2011年 7 月 1 日学 院经管学院年级、专业、班信息管理与信息系统姓 名苏浩辉学 导教师陈铿 成 绩教师评语教师签名： 【实验目的】给定如下二叉树，编程完成 该二叉树的先序，中序和后序遍历， 并输出其遍历序列。【实验内容】例程程序代码：using System;using System.Collections.Generic;using System.Linq;using System.Text;namespace 二叉树遍历{ class Node { private object _data; private Node _left; private Node _right; public object Data { get { return _data; } } public Node Left { get { return _left; } set { _left = value; } } public Node Right { get { return _right; } set { _right = value; } } public Node(object data) { _data = data; } public override string ToString() { return _data.ToString(); }}class BinaryTree{ private Node _head; private string cStr; public Node Head { get { return _head; } } public BinaryTree(string constructStr) { cStr = constructStr; _head = new Node(cStr[0]); Add(_head, 0); } private void Add(Node parent, int index) { int leftIndex = 2 * index + 1; if (leftIndex cStr.Length) { if (cStr[leftIndex] != *) { parent.Left = new Node(cStr[leftIndex]); Add(parent.Left, leftIndex); } } int rightIndex = 2 * index + 2; if (rightIndex cStr.Length) { if (cStr[rightIndex] != *) { parent.Right = new Node(cStr[rightIndex]); Add(parent.Right, rightIndex); } } } public void PreOrder(Node node) { if (node != null) { Console.Write(node.ToString()); PreOrder(node.Left); PreOrder(node.Right); } } public void MidOrder(Node node) { if (node != null) { MidOrder(node.Left); Console.Write(node.ToString()); MidOrder(node.Right); } } public void AfterOrder(Node node) { if (node != null) { AfterOrder(node.Left); AfterOrder(node.Right); Console.Write(node.ToString()); } } }class Program{ static void Main(string[] args) { BinaryTree bTree = new BinaryTree(ABCDEF*****G************H); Console.WriteLine(先序历遍为：\n); bTree.PreOrder(bTree.Head); //先序遍 Console.WriteLine(); Console.ReadLine(); Console.WriteLine(中序序历遍为：\n); bTree.MidOrder(bTree.Head); //中序遍 Console.WriteLine(); Console.ReadLine();