Binary Search Methods
After learning how to create a binary tree, we learned a few ways to search for items within those trees.
Depth First Search
This search goes all the way down on the left node, then works its way back up one by one.
Breadth First Search
This search works its way down, level by level.
Depth-Limited Search
Similar to Depth First, this node expands the deepest unexpanded node.
Iterative Deepening Search
This search uses a depth-limited search, however this search goes level by level.
Comments
Post a Comment