A priority queue is an Abstract Data Type(ADT) that operates similar to normal queue except that each element has certain priority.

A stack is a one-ended linear data structure which model a real world stack by having two primarily operations, namely push and pop.

A linked list is a sequential list of nodes that hold data which point to other nodes also containing data.

CS50是一堂哈佛大學的電腦通識課，課程公開在edx，本篇為上課隨手抄下的筆記。

A static array is a fixed length container containing n elements indexable from the range [0, n-1].