This is a CS mentoring session I did with Carol where we covered the how and why of the binary search algorithm. We did the session over repl.it and we even asked Ghostwriter - the repl.it AI what binary search is!
In this session I introduce the binary search tree, in a very roundabout way.
Carol and I continue our lesson on binary search trees. This time we focus in on how to add a new entry to the tree.
Carol and I continue our lesson on binary search trees. This time we focus on how to delete a node from the tree.
In this episode: Carol talk about one aspect of self-balancing trees: tree rotation.
In this session Carol and I work through how to traverse a binary tree, and we come up with an interesting result. Also, at the beginning of the video, we do an overview of the binary search tree series, and pose a challenge: to to do a range search with a binary search tree?
In this episode, Carol and I discover recursive traversal of binary search trees: in-order, pre-order, and post-order.