## Data Structures in TypeScript - Hash Table

A Hash table is a data structure with a highly efficient lookup, which store key values pairs

A Hash table is a data structure with a highly efficient lookup, which store key values pairs

Checking if a Binary Tree is a BST step by step

Binary Search Trees are useful when you need to insert, delete and search comparable elements.

Topological sort is an ordering of the vertices of a directed acyclic graph, in a way that if there is an edge from a vertex A to B, then A comes before B.

Graphs can be used to represent networks, websites structure, path optimization algorithms, there are also applications in other fields.

Queues can be used whenever is necessary to process things in a first-in-first-out order, also helps in algorithms of other data structures.

You can use stacks for expressions evaluations and conversion, backtracking, and memory management.

Linked Lists have some advantages over arrays and can be used to implement other data structures, such as stacks, queues, and graphs.

An array is a common data structure that holds items of the same type, in TypeScript, unlike other languages, an array doesn't have a fixed length.