using System;

​

public class BinaryTreeNode<T>

{

    public T Value { get; set; }

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

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

​

    public BinaryTreeNode(T value)

    {

        Value = value;

        Left = null;

        Right = null;

    }

}

​

public class BinaryTree<T> where T : IComparable<T>

{

    public BinaryTreeNode<T> Root { get; set; }

​

    public BinaryTree()

    {

        Root = null;

    }

​

    public void Insert(T value)

    {

        Root = InsertRec(Root, value);

    }

​

    private BinaryTreeNode<T> InsertRec(BinaryTreeNode<T> node, T value)

    {

        if (node == null)

        {

            return new BinaryTreeNode<T>(value);

        }

​

        if (value.CompareTo(node.Value) < 0)

        {

            node.Left = InsertRec(node.Left, value);

        }

        else if (value.CompareTo(node.Value) > 0)

        {

            node.Right = InsertRec(node.Right, value);

        }

        // Ignoring duplicates for simplicity

        return node;

    }

​

    public void InOrderTraversal(Action<T> action)

    {

        InOrderRec(Root, action);

    }

​

    private void InOrderRec(BinaryTreeNode<T> node, Action<T> action)

    {

        if (node != null)

        {

            InOrderRec(node.Left, action);

            action(node.Value);

            InOrderRec(node.Right, action);

        }

    }

}

​

public class Program

{

    public static void Main()

    {

        var tree = new BinaryTree<int>();

        Console.WriteLine("Enter integer values to add to the BST (type 'done' to finish):");

​

        while (true)

        {

            Console.Write("Enter a value: ");

            string input = Console.ReadLine();

​

            if (input.ToLower() == "done")

            {

                break;

            }

​

            if (int.TryParse(input, out int value))

            {

                tree.Insert(value);

                Console.WriteLine($"Added {value} to the tree.");

            }

            else

            {

                Console.WriteLine("Invalid input. Please enter an integer or 'done'.");

            }

        }

​

        // Print in-order traversal

        Console.WriteLine("\nIn-Order Traversal of the Binary Search Tree:");

        tree.InOrderTraversal(value => Console.Write(value + " "));

        Console.WriteLine();

    }

}