Comment on page
- BSTs have best-case height, and worst-case height.
- Big O is not the same as worst-case!
- B-Trees are a modification of the BST that maintainruntime for
containsin the worst case. They maintain perfect balance during insertion.
- A B-Tree has a limiton the number of values a node can hold, instead of having one item per node like a BST.
addin a B-Tree, we simply append the value to an existing leaf node in the correct location instead of creating a new leaf node. If the node is too full, it splits and pushes a value up.