Sharpach/Algorithms

[Data Structure] Binary search tree

Rizzen opened this issue · 3 comments

BST implementation

Are there any additional requirements for writing the BST implementation?

Are there any additional requirements for writing the BST implementation?

It must be BST, tests should be written. You allowed to use any language. If you use C# - preferable test framework - xUnit.

Alright, so BST written in C# which includes xUnit tests. Consider it done!