Blog

AVL Tree

AVL Tree is a self-balancing binary search tree.

Binary Search Tree

a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree.

Hash Table

Hash Table is a data structure that stores key-value pairs.

Queue

Queue is a data structure that stores elements in a linear structure.

Linked List

Linked List is a data structure that stores elements in a linear structure.

Stack

Stack is a data structure that stores elements in a linear structure.

Array

Array is a data structure consisting of a collection of elements (values or variables), of same memory size, each identified by at least one array index or key.