How does a search of a key value in a B-tree differ from a search in a binary search tree?

What will be an ideal response?

In general, each node may have several key values instead of one. The key value we are searching for may be one of these. Or, the target is in between two consecutive key values in this node. In that case, we continue the traversal to the appropriate subtree lying between the two key values. If the target value is less than the first node key or greater than the last key, then the search continues just like a binary search.