摘要: 本次的算法主要描述二叉树的遍历:using System;using System.Collections.Generic;namespace NET.MST.Thirteenth.BinaryTree{ class MainClass { /// <summary> /// 测试二叉树,和其中序、后序遍历 /// </summary> static void Main(string[] args) { int[] data = new int[] { 6, 1, 3, 9, 2, 7, 11 }; BinaryTree root = BinaryTree.Genera 阅读全文
posted @ 2011-05-20 20:34 brainmao 阅读(415) 评论(0) 推荐(0) 编辑