For finding a node in a $.....................,$ at each stage we ideally reduce the number of nodes we have to check by half. $(4$ points$)$

A$)$ binary tree

B$)$ binary search tree

C$)$ AVL tree

D$)$ binary heap tree