Binary search trees have deep heights (O(log2 N)), meaning every lookup requires 15-20 disk I/O operations. B+ Trees have a high fan-out (each node holds hundreds of keys), keeping tree height at 3-4 even for millions of records. Plus, all leaf nodes are linked in a doubly linked list, making range queries (`WHERE age BETWEEN 20 AND 30`) blistering fast.

During last Tuesday's sudden cloudburst near the main gate, my laptop bag was getting drenched with my final year project inside. You noticed, ran over with your navy blue umbrella, and walked alongside me all the way to the CS department portico even though you were heading towards Management block. You had white Converse shoes that got completely soaked in the muddy puddles because of me. I was so worried about my laptop that I barely mumbled a proper thank you before you turned back. I hope good karma finds you every single day.

Classic computer architecture experiment: Iterate over 100,000 integers and conditionally sum elements > 128. If the array is unsorted, the CPU's branch predictor misses 50% of the time, stalling the instruction pipeline. If the array is sorted, branch prediction accuracy is ~99%, and execution runs 6x faster. Understanding hardware mechanics makes you a dramatically better programmer.