24.03.26.md (379B)
1 # 24/03/26 2 3 - visulize arrays like so (binary tree) 4 ``` 5 0 6 1 2 7 3 4 5 6 8 ``` 9 - given the parent's index is I the left child's index is 2i + 1, and for the right child is 2i + 2 10 - for the children, the parent's index can be found as (i - 1) / 2 (rounded down) 11 12 - max heap is a btree where a parent's value is greater than or equal to the values of its children, not the sum