10:00 How do I find that 7 though? 7 is larger than 3 so I go right, 7 is larger than 5 so I go right again and 7 is larger than 6 but there is no leaf node, therefore row is not found I think the adding is done the same way we search, so it would be added to right of node 6 and then rebalanced if needed And probably that rebalancing is what takes most time? So if you're lucky the insert is fast but in some cases it is a bit slower?
Great video
10:00 How do I find that 7 though?
7 is larger than 3 so I go right, 7 is larger than 5 so I go right again
and 7 is larger than 6 but there is no leaf node, therefore row is not found
I think the adding is done the same way we search, so it would be added to right of node 6 and then rebalanced if needed
And probably that rebalancing is what takes most time? So if you're lucky the insert is fast but in some cases it is a bit slower?
You are right. The example is a bit off!
Perfect video for indexes