Given the root of a complete binary tree (every level full except possibly the last, which is filled left to right), return the number of nodes. Aim for better than O(n).