Binary Search Tree for Large Data
Lets see how binary search tree (BST) can help us swiftly insert, update, delete, search on large amount of data like 50K.
Imagine we have a table of 50K rows of data. Data are
continuously updated, added, deleted; and then make it worse,
frequently searched too. Let's use binary search tree on it.
Orders
(Binary search tree implemented)
| Order ID |
Customer Name |
Product |
Price |
|
Orders
(Binary search tree DIDN'T implemented)
| Customer Name |
Product |
Price |
|