using System;

​

public class Program

{

    public Node root;

    public static int Min = int.MaxValue;

    public class Node

    {

        public int data;

        public Node left;

        public Node right;

        public Node(int d)

        {

            data = d;

            left = right = null;

        }

    }

​

    public Node InsertNode(Node root, int val)

    {

        if (root == null)

        {

            return (new Node(val));

        }

        else

        {

            if (root.data <= val)

            {

                root.right = InsertNode(root.right, val);

            }

            else

            {

                root.left = InsertNode(root.left, val);

            }

​

            return root;

        }

    }

​

    public void MinimumValue(Node tree)

    {

        if (tree == null)

        {

            return;

        }

​

        if (tree.data < Min)

        {

            Min = tree.data;

        }

        MinimumValue(tree.left);

        MinimumValue(tree.right);

    }

​

    public static void Main()

    {

        Program tree = new Program();

        int[] array = new int[]{4, 2, 1, 3, 6, 5};

        tree.root=new Node(array[0]);

        for (int i = 1; i < array.Length; i++)

        {

            tree.InsertNode(tree.root, array[i]);

        }

        tree.MinimumValue(tree.root);

        Console.WriteLine("Min value:{0}",Min);

    }

}