Comments by "Benjamin Rood" (@benisrood) on "MIT OpenCourseWare" channel.

  1. Working on his own research, yes I am sure he would! Especially when the students are so slow to give answers...
    2
  2. The issue comes down to this: We have a complete and stativ picture of the subway stops for L0 and L1, so we know that overshooting and then going one stop back is faster. Your software/algorithm doesn't have this picture. How does a piece of software get that complete picture? The only way it can get it for any given moment in time would be by iterating through the complete list, at all levels. Once you've done that, you've lost all of the performance/optimisation advantages that a skip-list offers over a regular linked-list, in fact it's slightly slower 😂 If computers could have a "bird-eve" view of a data structure, then they could just insert the value at the right place every time in one step. Unfortunately, there is no such magic.
    2
  3. What the others said, plus Ling clearly said that the answer was m+n. In your example case, 3+3 = 6, which is correct (when you include the missing case RUUR)
    1