Runtime of O(log(n)) function

Question

I made an AVL tree in C++, and the tree is kept balanced successfully according to all of my tests. The function addNode should work in O(log(n)) (when n is the