# Time/space complexity

For basically everthing, just list it out somewhere on sheet

# AVL Tree's

Get some functions for them written out
Insert/Deletion/Lookup Functions

# No pathfinding code
_mainly cuz we never did any for homework/class_

Time/space complexities should be straightforward memorization

# Tries


# Huffman

Decoding: 
:	Time - O(n) {n = number of input bits}

Encoding
:	Time O(nlog(n))
:	Where n is the number of unique bits in the string


# Pathfinding - Conceptual things

Admissability: allowed to underestimate but not overestimate.

> Heuristic?

* A-star
* Best-first

> Multiple sources

* Floyd's Algorithm

> Multiple destination

* Floyd's 
* Bellman-Ford

> Negative edges

* Floyd
* Bellman-Ford

> Negative Cycles

None
