I'm running this at the bottom of my insertion function. It (should) take the newly inserted node as the parameter, then update its parent node's count(number of nodes below it + itself) to refect the addition of the new node, and recurse up the tree till the top.