title: Starting with an empty tree, what is the complexity of inserting into Red Black Tree in big-O notation?
body: <p>If I have 10 elements and starting with an empty tree, What is the complexity of inserting 10 elements into Red Black in big-O notation? </p>
  
  <p>Is it going to be more than O(log 10) because each time it inserts an element, it has to search for appropriate location for the element and performs a series of rotations between ancestor nodes and child nodes. So if I have N element and inserting N times into Red Black Tree, wouldn't that make it O(n log n)?</p>
  
  <p>Thanks for any help.</p>