Initializing the Library Code

1) Created the basic file and folder structure
2) Added the Stack class to the Library
3) Made changes to the package.json file
Added License, Stack

1) Added MIT License
2) Added the Stack Data Structure
3) Started creation of tests in regard to Stack
Edited the README file
Added new Data Structures and modified old ones

1) Queue and Dequeue added - Memory optimized implementations
2) Stack modified to include new functionality of isEmpty
3) Modified README and test libraries
Completed Dequeue and Queue implementations
Added the Binary Search Tree data structure
Added Linked List data structure and modified existing

1) Modified Stack, Queue and Dequeue - Added a search function in each
2) Binary Tree - Completed the insert and search functionality
3) Added provision for a Comparator for performing comparison among objects
Added Linked List data structure and other modifications

1) Linked List - Insert, Delete and Search operations added
2) Modified README to re-direct to Github Wiki
Code enhancements and Documentation

1) Documentation Process started - Stack Class documented
2) Iterator Provided in Stack, Queue, and Dequeue classes
Added new data structures and modified existing ones

1) Doubly Linked List - Added and functionality completed
2) Linked List - Added Iterator to existing data structure
Enhancements and Updates

1) Binary Search Tree - Completed Iterator implementation for Pre and In Order Traversal
2) Red-Black Tree - Started with the implementation
3) Defined the new data structures (To be started) - Max-Heap, Min-Heap, Priority Queue
Red-Black Tree - Insert implementation completed
Completed Red-Black Tree implementation