A simple Javascript Library for Data Structures and Algorithms. Currently it supports Stack,Queue, Binary Search Trees.
| Data Structure | Supported Methods |
|---|---|
| Stack | Push: To insert value into Stack Pop : To remove value from Stack isEmpty : To check if stack is Empty isNotEmpty : To check is stack is not Empty |
| Queue | Enqueue: To insert a value into the queue. Dequeue: To remove value from the queue. isEmpty : To check if the queue is Empty. isNotEmpty : To check is queue is not Empty |
| Binary Search Tree | insert : To insert value into BST. inorder : Returns inorder of the Tree. PreOrder : Returns preorder of the Tree. PostOrder : Returns PostOrder of the Tree. |