Data Structures

Rabin-Karp string search algorithm in Golang.

Pancake Sort in Golang.

LIFO and FIFO in Golang.

Insert a node into the AVL tree.

Remove a single item from an AVL tree.

The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "substring" within a main "string" by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters.

A binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right".

In computer science, a linked list is a linear collection of data elements, in which linear order is not given by their physical placement in memory.

A Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression.

AVL trees are height balancing binary search tree.