public void BinarySearchTreeCreation_Run()
        {
            /* Will take a look at at when get time
             * var binarySearchTree = BinarySearchTreeNode.Create_Random(10, 0, 9);
             * binarySearchTree.Print();
             * Console.WriteLine($"CheckIfBinaryTreeIsBinarySearchTree ={CheckIfBinaryTreeIsBinarySearchTree((BinaryTreeNode)binarySearchTree)}");
             */
            //arraySample.Reverse();

            var binarySearchTree2_1 = BinarySearchTreeNode.CreateMinimalBinarySearchTree(new int[] { 1, 2, 3, 4 });

            binarySearchTree2_1.Print();
            Console.WriteLine($"CheckIfBinaryTreeIsBinarySearchTree ={ValidateBinarySearchTree(binarySearchTree2_1)}");

            var binarySearchTree2_2 = BinarySearchTreeNode.CreateMinimalBinarySearchTree(new int[] { 1, 2, 3, 4, 5 });

            binarySearchTree2_2.Print();
            Console.WriteLine($"CheckIfBinaryTreeIsBinarySearchTree ={ValidateBinarySearchTree(binarySearchTree2_1)}");

            var binarySearchTree2 = BinarySearchTreeNode.CreateMinimalBinarySearchTree(arraySorted_UniqueElements);

            arraySorted_UniqueElements.Print("Input for CreateMinimalBinarySearchTree:");
            binarySearchTree2.Print();
            Console.WriteLine($"CheckIfBinaryTreeIsBinarySearchTree ={ValidateBinarySearchTree(binarySearchTree2)}");

            var binarySearchTree3 = BinarySearchTreeNode.CreateMinimalBinarySearchTree(arraySorted_UniqueElements, 0, 4);

            arraySorted_UniqueElements.Print("\nInput CreateMinimalBinarySearchTree(arr, start, end):", 0, 4);
            binarySearchTree3.Print();
        }
        public void HasPathSum_Run()
        {
            var binarySearchTree = BinarySearchTreeNode.CreateMinimalBinarySearchTree(arraySorted_UniqueElements);

            arraySorted_UniqueElements.Print("Input for CreateMinimalBinarySearchTree:");
            binarySearchTree.Print();
            int sum  = 8;
            int sum2 = 4;

            Console.WriteLine($"HasPathSum of {sum} ={HasPathSum(binarySearchTree, sum)}  HasPathSum of {sum2} ={HasPathSum(binarySearchTree, sum2)}");
        }