Very concise five-step guide 🙃
We have something like binary search trees. Really simple data structure. But we have also plenty of different tree-like structures: splays, AVLs, red-black trees and so on. Why is that? Why are BSTs not enough?
There are some days that seem to leads to no good. One of these days has come to me when I needed to do some serious assembly programming.
Algorithmic complexity is a crucial thing in computer science. Knowing the complexity of algorithms allows to answer following questions: How long will a program run on an input? How much space will it take? Is the problem solvable?