Reforming the trees — C# and F# comparison

During the recent years, creation of parallel secure programs has become one of the main goals since microprocessors are no more a rarity. Functional languages are assisting us to keep up the parallelism enabling inclusion of unchangeable structures of data, which can be transferred between streams and computers, even without additional security for the streams or atomic access. Besides, functional languages simplify creation of libraries, supporting parallel processing (for example, asynchronous working streams F#). In this article we consider the information on trees and main operations: finding elements in the tree, inserting and removing elements and also traversing the tree by means of two programming languages F# and C#. We will compare calculation process time parameters.