a sp代码题.docVIP

汉诺塔: namespace 汉诺塔 {class HanoiBuilder {void hanoi(int n,string A,string B,string C) {if(n==1) Console.WriteLine(A+------+C); else{ hanoi(n-1,A,C,B);//借助C把A上的盘子移到B Console.WriteLine(A+-------+C); hanoi(n-1,B,A,C);//借助A把B上的盘子移到C}} public void Hanoi(int n) {hanoi(n,A,B,C);} } class Test {static void Main() {HanoiBuilder hb=new HanoiBuilder(); hb.Hanoi(2); Console.ReadLine();} }} 二叉树遍历: namespace BinaryTree { public class Node//节点类 { private object _nodeValue; private Node _leftNode; private Node _rightNode; public object NodeValue { get { return this._nodeValue; } } public Node LeftNode { get {return this._leftNode; } set {this._leftNode = value; } } public Node RightNode { get{return this._rightNode; } set{this._rightNode = value;} } public Node() { } public Node(object nodeValue, Node leftNode, Node rightNode) { this._nodeValue = nodeValue; this._leftNode = leftNode; this._rightNode = rightNode; } public Node(object nodevalue) { this._nodeValue = nodevalue; this._leftNode = null; this._rightNode = null; } } public class BTree { private static Node root = null; public static void CreateTree() { Node node1 = new Node(1, null, null); Node node2 = new Node(2, null, null); Node node3 = new Node(3, null, null); Node node4 = new Node(4, null, null); Node node5 = new Node(5, null, null); Node node6 = new Node(6, null, null); Node node7 = new Node(7, null, null); node1.LeftNode = node2; node1.RightNode = node3; node2.LeftNode = node4; node2.RightNode = node5; node3.LeftNode = n