### General - [[Tree Properties]] - [[Minimum Spanning Trees (MST)]] ### Algorithms - [[Binary Trees]] - [[Binary Search Trees]] - **root** is the top of the tree - everything in tree accessible from there - nodes without children are called **leaf** nodes - depth goes like this: - root = 0, it's children = 1, then 2 etc. - every child has depth of: - parent's depth + 1 - leaf node's children are null - look like real life trees, growing branches from the root