Implementations of popular data structures on JS In this repository you can find my implementations of most popular data structures and their short-descriptions.
To help in the preparation to tech interview, or study basic data structures. It's very important part of high quality application, therefore, every qualified software developer should know them.
-
Linked list is a linear collection of data elements, whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence. In its most basic form, each node contains: data, and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration. More complex variants add additional links, allowing more efficient insertion or removal of nodes at arbitrary positions.
-
Stack like list. But you can only add value to end stack and remove last value in stack. Also method "Peek" show top value in stack.
-
In process
-
In process
-
In process
-
In process
-
In process
-
In process
-
In process
-
In process