C#的BinaryTree实现

C#的BinaryTree实现

个程序中需要二叉树，所以在C#中作了一个。

程序中共三个类：BinaryTreeNode、BinaryTree、Visitor。

Visitor是一个delegate。

public class BinaryTreeNode

{

internal object _data;

internal BinaryTreeNode _leftChild;

internal BinaryTreeNode _rightChild;

public BinaryTreeNode()

{

}

public BinaryTreeNode(object e)

{

_data = e;

}

public BinaryTreeNode(object e,

BinaryTreeNode left,

BinaryTreeNode right

)

{

_data = e;

_leftChild = left;

_rightChild = right;

}

}

public delegate void Visitor(BinaryTreeNode u);

public class BinaryTree

{

private BinaryTreeNode _root;

public BinaryTree()

{

}

public bool IsEmpty

{

get