previous | index | next

Back to the Movie Database

Q: How do we exploit a divide and conquer method on the movie database?

A: We can't, if we continue to use a flat list to organize the movies,

Q: Why?

A: To find the middle of the list we have to start at the beginning to get there. (still sequential!)

Instead, we must organize the list of movies in a non-linear way, called a binary search tree.


previous | index | next