using System;

​

public class Program

{

    public static void Main()

    {

        int[] treeData = new int[]{10, 15, 5, 22};

        int target = 12;

        int closestNodeValueRecorded = 0;

        int a = 22 % target;

        var tree = new BinarySearchTree();

        Node root = new Node()

        {Value = treeData[0]};

        for (var i = 1; i < treeData.Length; i++)

        {

            root = tree.Insert(root, treeData[i]);

        }

    }

​

    public class BinarySearchTree

    {

        public Node Insert(Node node, int value)

        {

            if (value > node.Value)

            {

                node.Right = new Node{Value = value};

            }

            else if (node.Value <= value)

            {

                node.Left = new Node{Value = value};

            }

​

            return node;

        }

    }

​

    public class Node

    {

        public int Value;

        public Node Left;

        public Node Right;

    }

}