Implementation of different data structures in GO.

Data structures

Stack
Queue
Singly-Linked List
Doubly-Linked List
Skip List
Hash Table
Set
Priority Queue
Binary Search Tree
Cartesian Tree
B-Tree Balanced Tree
Red-Black Tree
Splay Tree
AVL Tree
KD Tree
Trie
Knuth-Morris-Pratt - https://web.stanford.edu/class/cs97si/10-string-algorithms.pdf
Graph
Ternary Search Tree
Disjoint sets
Binary Indexed Tree

Name	Name	Last commit message	Last commit date
Latest commit altay13 added new method to bstree Apr 6, 2019 cc2c3cc · Apr 6, 2019 History 10 Commits
algorithms	algorithms	bug fixes	Jan 11, 2019
avltree	avltree	initial commit	Jul 11, 2018
bstree	bstree	added new method to bstree	Apr 6, 2019
btree	btree	working on new features	Dec 2, 2018
cartesiantree	cartesiantree	initial commit	Jul 11, 2018
doublylinkedlist	doublylinkedlist	working on new features	Dec 2, 2018
graph	graph	bug fixes	Jan 11, 2019
hashtable	hashtable	working on new features	Dec 2, 2018
linkedlist	linkedlist	initial commit	Jul 11, 2018
queue	queue	bug fixes	Jan 11, 2019
rbtree	rbtree	added unique flag to bstree. In case if you want to keep identical keys	Apr 4, 2019
set	set	bug fixes	Jan 11, 2019
stack	stack	bug fixes	Jan 11, 2019
trie	trie	initial commit	Jul 11, 2018
.gitignore	.gitignore	initial commit	Jul 11, 2018
LICENSE	LICENSE	initial commit	Jul 11, 2018
README.md	README.md	Update README.md	Dec 6, 2018
TODO.md	TODO.md	initial commit	Jul 11, 2018
main.go	main.go	bug fixes	Jan 11, 2019