http://ww.enginpolat.com/csharp-binary-search-tree-ornegi/

926

C# Binary Search Tree örneği

AddMethod.cs

public void Add(params T[] values)
{
    if (values == null || !values.Any())
    {
        throw new ArgumentOutOfRangeException("Please fill values parameter, or it'll throw an exception!");
    }

    var _values = new List<T>(values);
    var middle = _values.OrderBy(e => e).Skip(_values.Count / 2).First();
    _values.Remove(middle);
    _values.Insert(0, middle);

    foreach (var value in values)
    {
        if (this.Top == null)
        {
            Top = new Node<T>() { Value = value };

            continue;
        }

        var current = this.Top;
        var added = false;

        do
        {
            if (Comparer<T>.Default.Compare(value, current.Value) == -1)
            {
                // go for left
                if (current.Left == null)
                {
                    current.Left = new Node<T>() { Value = value };
                    added = true;
                }
                else
                {
                    current = current.Left;
                }
            }
            else
            {
                // go for right
                if (current.Right == null)
                {
                    current.Right = new Node<T>() { Value = value };
                    added = true;
                }
                else
                {
                    current = current.Right;
                }
            }
        } while (!added);
    }
}

AddWithParamsTArray.cs

// Add(5, 8, 3);
public void Add(params T[] value)
{
}

AddWithT.cs

// Add(5);
public void Add(T value)
{
}

AddWithTArray.cs

// Add(new int[] { 5, 8, 3 });
public void Add(T[] value)
{
}

dotnet-new.cmd

dotnet new console

ForEachLoop.cs

foreach (var value in values)
{
    if (this.Top == null)
    {
        Top = new Node<T>() { Value = value };

        continue;
    }

    var current = this.Top;
    var added = false;

    do
    {
        if (Comparer<T>.Default.Compare(value, current.Value) == -1)
        {
            // go for left
            if (current.Left == null)
            {
                current.Left = new Node<T>() { Value = value };
                added = true;
            }
            else
            {
                current = current.Left;
            }
        }
        else
        {
            // go for right
            if (current.Right == null)
            {
                current.Right = new Node<T>() { Value = value };
                added = true;
            }
            else
            {
                current = current.Right;
            }
        }
    } while (!added);
}

Node.cs

public class Node
{
    public int Value { get; set; }

    public Node Left { get; set; }

    public Node Right { get; set; }
}

NodeOfT.cs

public class Node<T>
{
    public T Value { get; set; }

    public Node<T> Left { get; set; }

    public Node<T> Right { get; set; }
}

SelectMiddleItem.cs

var _values = new List<T>(values);
var middle = _values.OrderBy(e => e).Skip(_values.Count / 2).First();
_values.Remove(middle);
_values.Insert(0, middle);

TreeOfT.cs

public class Tree<T>
{
    public Node<T> Top { get; set; }
}