@Nile
Web Developer/ Front-end engineer who loves solving Rubik's Cube
Nothing here yet.
Nothing here yet.
A binary Search Tree is a node-based binary tree data structure. It has the following properties: Every parent node has at most two children. Every node to the left is always less than the parent node. Every node to the right is always greater tha...

Almost identical to the singly-linked lists, except every node has another pointer, to the previous node. It provides more flexibility over singly-linked lists. Todos: 1. Push and Pop 2. Unshift and Shift 3. Get and Set 4. Insert and Remove Creating ...
