Create Binary Search Tree | C# Online Compiler

Create Binary Search Tree by Robert Bakos

using System;

public class TreeNode
{
	public TreeNode _Left;
	public TreeNode _Right;
	public int _Value;
	public TreeNode(TreeNode Left, int Value, TreeNode Right)
	{
		_Left = Left;
		_Right = Right;
		_Value = Value;
	}

	public int CompareTo(TreeNode other)
	{
		return ((other != null) ? (_Value - other._Value) : 0);
	}

	public void InsertNode(TreeNode node)
	{
		if (CompareTo(node) > 0)
		{
			// insert left
			if (_Left == null)
			{
				_Left = node;
			}
			else
			{
				_Left.InsertNode(node);
			}
		}
		else
		{
			// insert right
			if (_Right == null)
			{
				_Right = node;
			}
			else
			{
				_Right.InsertNode(node);
			}
		}
	}

	public void PrintValue()
	{
		Console.WriteLine("Value: " + _Value);
		Console.WriteLine("Left of " + _Value + "...");
		if (_Left == null)
		{
			Console.WriteLine("NULL");
		}
		else
		{
			_Left.PrintValue();
		}

		Console.WriteLine("Right of " + _Value + "...");
		if (_Right == null)
		{
			Console.WriteLine("NULL");
		}
		else
		{
			_Right.PrintValue();
		}
	}

	public int DepthOfValue(int value)
	{
		if (_Value == value)
		{
			return 1;
		}
		else if (_Value > value)
		{
			// depth left
			if (_Left == null)
			{
				return -1;
			}

			int depthLeft = _Left.DepthOfValue(value);
			if (depthLeft == -1)
			{
				return -1;
			}

			return depthLeft + 1;
		}
		else if (_Value < value)
		{
			// depth right
			if (_Right == null)
			{
				return -1;
			}

			int depthRight = _Right.DepthOfValue(value);
			if (depthRight == -1)
			{
				return -1;
			}

			return depthRight + 1;
		}
		else
		{
			return -1;
		}
	}
}

public class Program
{
	public static TreeNode _Root;
	public static void Main()
	{
		int[] values =
		{
		2, 7, 4, 8, 9, 14, 22, 36, 55, 3, 6, 1
		}

		;
		BuildTree(values);
		_Root.PrintValue();
		Console.WriteLine("Depth of value: " + _Root.DepthOfValue(99));
	}

	private static void BuildTree(int[] elements)
	{
		foreach (int i in elements)
		{
			TreeNode node = new TreeNode(null, i, null);
			if (_Root == null)
			{
				_Root = node;
			}
			else
			{
				_Root.InsertNode(node);
			}
		}
	}
}

​x
 
using System;
​
public class TreeNode
{
    public TreeNode _Left;
    public TreeNode _Right;
    public int _Value;
    public TreeNode(TreeNode Left, int Value, TreeNode Right)
    {
        _Left = Left;
        _Right = Right;
        _Value = Value;
    }
​
    public int CompareTo(TreeNode other)
    {
        return ((other != null) ? (_Value - other._Value) : 0);
    }
​
    public void InsertNode(TreeNode node)
    {
        if (CompareTo(node) > 0)
        {
            // insert left
            if (_Left == null)
            {
                _Left = node;
            }
            else
            {
                _Left.InsertNode(node);
            }
        }
        else
        {
            // insert right
            if (_Right == null)
            {
                _Right = node;
            }
            else
            {
                _Right.InsertNode(node);
            }
        }
    }
​
    public void PrintValue()
    {
        Console.WriteLine("Value: " + _Value);
        Console.WriteLine("Left of " + _Value + "...");
        if (_Left == null)
        {
            Console.WriteLine("NULL");
        }
        else
        {
            _Left.PrintValue();
        }
​
        Console.WriteLine("Right of " + _Value + "...");
        if (_Right == null)
        {
            Console.WriteLine("NULL");
        }
        else
        {
            _Right.PrintValue();
        }
    }
​
    public int DepthOfValue(int value)
    {
        if (_Value == value)
        {
            return 1;
        }
        else if (_Value > value)
        {
            // depth left
            if (_Left == null)
            {
                return -1;
            }
​
            int depthLeft = _Left.DepthOfValue(value);
            if (depthLeft == -1)
            {
                return -1;
            }
​
            return depthLeft + 1;
        }
        else if (_Value < value)
        {
            // depth right
            if (_Right == null)
            {
                return -1;
            }
​
            int depthRight = _Right.DepthOfValue(value);
            if (depthRight == -1)
            {
                return -1;
            }
​
            return depthRight + 1;
        }
        else
        {
            return -1;
        }
    }
}
​
public class Program
{
    public static TreeNode _Root;
    public static void Main()
    {
        int[] values =
        {
        2, 7, 4, 8, 9, 14, 22, 36, 55, 3, 6, 1
        }
​
        ;
        BuildTree(values);
        _Root.PrintValue();
        Console.WriteLine("Depth of value: " + _Root.DepthOfValue(99));
    }
​
    private static void BuildTree(int[] elements)
    {
        foreach (int i in elements)
        {
            TreeNode node = new TreeNode(null, i, null);
            if (_Root == null)
            {
                _Root = node;
            }
            else
            {
                _Root.InsertNode(node);
            }
        }
    }
}

View IL Code