本文实例讲述了C#二叉搜索树插入算法。分享给大家供大家参考。具体实现方法如下：
public class BinaryTreeNode
{
public BinaryTreeNode Left { get; set; }
public BinaryTreeNode Right { get; set; }
public int Data { get; set; }
public BinaryTreeNode(int data)
{
this.Data = data;
}
}
public void InsertIntoBST(BinaryTreeNode root, int data)
{
BinaryTreeNode _newNode = new BinaryTreeNode(data);
BinaryTreeNode _current = root;
BinaryTreeNode _previous = _current;
while (_current != null)
{
if (data < _current.Data)
{
_previous = _current;
_current = _current.Left;
}
else if (data > _current.Data)
{
_previous = _current;
_current = _current.Right;
}
}
if (data < _previous.Data)
_previous.Left = _newNode;
else
_previous.Right = _newNode;
}
希望本文所述对大家的C#程序设计有所帮助。
您可能感兴趣的文章:C#深度优先搜索算法