Learn searching algorithms with Python examples and coding exercises, starting with binary search and binary search trees. Preview balanced trees and game-tree search.
your first win
Trace the middle of a sorted list, implement binary search, and test it against hidden cases.
mid = (low + high) // 2
if array[mid] == target:
return midThe path
Learn how binary search halves a sorted list, trace a worked example, and implement it in Python with O(log n) time and O(1) extra space.
Understand binary search trees, search and insertion in Python, tree traversals, and why balanced trees keep operations fast.
Linear Search Explained
Coming soon: scan a sequence one item at a time and compare linear search with binary search.
coming soon
Red Black Tree Explained
Coming soon: understand how red-black trees use color rules and rotations to keep search, insertion, and deletion logarithmic.
coming soon
B Trees Explained
Coming soon: learn how B-trees store multiple keys per node to support efficient searching in databases and storage systems.
coming soon
Monte Carlo Tree Search Explained
Coming soon: explore MCTS selection, expansion, simulation, and backpropagation for game-playing and decision-making.
coming soon