This Python program will hold sample code for a number of classic data structures implemented in Python.

Another Node-chain setup but with first in and first out principles

Source: http://ls.pwd.io/2014/08/singly-and-doubly-linked-lists-in-python/

This is my parenthetics parser for checking if a string is either open, broken or even.

This is Nadia's parser for parentheisis.

Anothe Node-chain setup composed with double linked list but with the following attributes:

- pop()
- popleft()
- size()
- peek()
- peekleft()
- append(val)
- appendleft(val)

A binnary heap structure that sorts max value at the pinnical and seach child of each parent in the triplicated format must be less then the parent. Fits the algorithm of i, 2i, 2i+1 where i is the parent and the next two are children.