DataStructures

Array

• a generic class representing an array.
• implemented 4 sorting algorithms: heap, quick, merge, insertion.
• added test that generates a random array and asserts that the array is sorted after each one of the above sorting methods.

Dynamic Array

• a generic class representing a dynamic array.
• implemented push, pop methods.
• when the array is too big or too small, i.e. the client pushes to a full array or pops from less than 25% full array than the array resizes.

Binary Search Tree

• a generic class representing a BST;
• implemented insert, search, delete methods
• added a unittests for all methods