Given a Binary Tree, we know it's complete, but we don't know how many nodes are in the tree. Can you insert another node in less than O(n) complexity? Was able to do in (logn)^2.