$13.$ In $.............................$ ; for any node n$,$ every descendant node$$s value in the left subtree of n is less than the value of n and every descendant node$$s value in the right subtree is greater than the value n$.(4$ points$)$

A$)$ binary tree

B$)$ binary search tree

C$)$ AVL tree

D$)$ binary heap tree