Binary search trees, 2-3-4 trees, and red-black trees

“Computer science is no more about computers than astronomy is about telescopes.” —Edsger Dijkstra Introduction The Binary Search Tree B-Trees and 2-3-4 Trees Red-black Trees Conclusion Thank you to Val, Heli, and Damien for beta-reading! Introduction When presented with an overwhelming amount of data, how would you change its structure for ease of access and use? Let me reframe that question in a…