using System;

using System.Collections.Generic;

​

public class Node

{

    public int Value { get; set; }

    public Node Left { get; set; }

    public Node Right { get; set; }

​

    public Node(int value)

    {

        Value = value;

    }

​

    public static void Insert(Node root, int value)

    {

        if (value < root.Value)

        {

            if (root.Left == null)

                root.Left = new Node(value);

            else

                Insert(root.Left, value);

        }

        else

        {

            if (root.Right == null)

                root.Right = new Node(value);

            else

                Insert(root.Right, value);

        }

    }

​

    public static void BFS(Node root)

    {

        if (root == null)

            return;

        Queue<Node> queue = new Queue<Node>();

        queue.Enqueue(root);

        while (queue.Count > 0)

        {

            Node current = queue.Dequeue();

            Console.Write(current.Value + " ");

            if (current.Left != null)

                queue.Enqueue(current.Left);

            if (current.Right != null)

                queue.Enqueue(current.Right);

        }

    }

​

    public static void DFS(Node root)

    {

        if (root == null)

            return;

        DFS(root.Left);

        Console.Write(root.Value + " ");

        DFS(root.Right);

    }

}

​

public class Program

{

    public static void Main()

    {

        Console.WriteLine("Hello World");

        Random random = new Random();

        Node tree = new Node(10);

        for (int i = 0; i < 10; i++)

        {

            var rnd = random.Next(0, 20);

            Console.Write(rnd + " ");

            Node.Insert(tree, rnd);

        }

​

        Console.WriteLine();

        Console.WriteLine("BFS:");

        Node.BFS(tree);

        Console.WriteLine();

        Console.WriteLine("DFS:");

        Node.DFS(tree);

    }

}