Exemplos de TWL_Algorithms_Samples.Tree BinarySearchTreeNode em C# (CSharp)

Exemplo n.º 1

        public static BinarySearchTreeNode Create_Random(int N, int min, int max)
        {
            int[] dataArray           = new int[N];
            int   d                   = AssortedMethods.RandomIntInRange(min, max);
            BinarySearchTreeNode root = new BinarySearchTreeNode(d);

            dataArray[0] = d;
            for (int i = 1; i < N; i++)
            {
                dataArray[i] = AssortedMethods.RandomIntInRange(min, max);
            }
            dataArray.Print();
            for (int i = 1; i < N; i++)
            {
                root.InsertInOrder(dataArray[i]);
                root.Print();
            }
            return(root);

            //return CreateMinimalBinarySearchTree(dataArray);
        }