Data-structures

Creating a queue from a stack.

Binary Heaps & Priority Queues in JavaScript

In a circular or linked list which loops, we do not have a tail. The 'last' node in the list will point to a node in the list. This algorithm will detect if this has occurred.

Singly Linked List is a popular interview topic. This is a simple implementation of a singly linked list will show you the ropes of how to implement a singly linked list.

All about stacks and queues. Covers uses, methods and implementations.

How can we visit every node one time? There are many ways to print out the nodes of a tree.

Terminology, implementation and common methods of trees and binary search trees.

Weave receives two queues as arguments and combines the contents of each into new, third queue.

Implementation and methods of a queue.