Just calling insert
the correct number of times should indeed produce the correct tree -- but it'll take O(n log n) complexity, where it can be done with O(N) complexity.
In all honesty, unless you're working with a lot of data, the difference may not be terribly significant for you.