Data structure is known as ADT, which is independent of
implementation. For example, stack can be implemented by array or
linked list. Such as stack in STL library, It’s implemented by deque
default.
Linear and hierarchical structures. Array, linked lists, stacks and
queue are linear structures. And tree, graph, heaps are hierarchical.
STL is a good reference when you learn data structure, especially
interface of STL container. such as push, pop and top for stack and
priority_queue. For queue, besides push() pop(), there are also front()
and back(). Just remember four words, push pop front back
All the normal container(not including adaptor container, stack, queue,
priority_queue) includes four basic operations: begin(), end(), insert()
and erase().
Big O notation. Remember below English words: constant,
logarithmic (log n), linear (n) linearithmic (n*log(n)) , quadratic 2n,
polynomial(quadratic cubic), exponential cn. factorial n!