Um OK! THIS IS PLUG & CHUG!

Full Binary Tree - Every node has either 0 or 2 children

Complete Binary Tree - Filled every level except maybe the last which is filled left to right

Minimum number of nodes is height + 1

Maximum number of nodes is 2^(height + 1) - 1

Queue is first in first out FIFO

Stack is last in first out LIFO

TreeMap is logn for get set remove

Open Hashing average is 1, worst is n

Load factor for hashing is size / 2

Linear probing is value % size and then +1 index for every collision

Summation loop is n(n + 1) / 2

Huffman bits

Breadth-fist - Search each depth level of the tree before moving on to the next level, ensuring that all nodes at a given depth are explored.

Depth-first - Explore as far down one branch of the tree as possible before backtracking to explore other branches, prioritizing depth over breadth.