A binary search tree is a binary tree T with each position p storing a key$-$value pair $($k$,$ v$)$ such that:

Each correct answer represents a part of the solution. Choose all that apply.

This type of question contains radio buttons and checkboxes for selection of options. Use Tab for navigation and Enter or space to select the option.

A

option A

Keys stored in the right subtree of p are less than k$.$

B

option B

Keys stored in the left subtree of p are less than k$.$

C

option C

Keys stored in the right subtree of p are greater than k$.$

D

option D

Keys stored in the left subtree of p are greater than k$.$