I am a Professor in the Computer Science department at the University of Cambridge. Through this channel I welcome anyone in the world to attend my lectures. This video is part of my first-year Algorithms course.
The 2-3-4 Tree is a search tree related to the BST but it is not binary: each of its nodes may have 2, 3 or 4 children, hence the name.
The great thing about the 2-3-4 tree is that every path from the root to any leaf has exactly the same length: the tree is perfectly balanced. This guarantees O(lg n) performance for all the canonical operations of a search tree.
Many thanks to those of you who are giving thumbs up to these videos and subscribing to the channel. Your support is greatly appreciated and it causes Youtube to offer this material to more viewers who might like it.
Course web page:
https://www.cl.cam.ac.uk/teaching/current/Algorithm1/
Course handout:
https://www.cl.cam.ac.uk/teaching/current/Algorithm1/2021-2022-stajano-algs1-handout.pdf
My home page:
http://frank.stajano.com
Add comment