Final answer:
A binary search tree organizes values in ascending alphabetical order based on the keys. Each node in the tree has a left and right child, arranged such that the left child is less than the parent and the right child is greater.
Step-by-step explanation:
In a binary search tree, the values are organized in normal ascending alphabetical order based on the keys. Each node in the tree has a left and right child, which are arranged such that the value of the left child is less than the value of the parent node, and the value of the right child is greater than the value of the parent node. This ensures that when you traverse the tree in an in order traversal, the values will be visited in ascending order.
For example, let's say we have a binary search tree for words: 'apple', 'banana', 'cherry', 'grapes', 'kiwi', and 'pear'. The tree would look like:
pear
/
banana kiwi
/
apple cherry
grapes
When we traverse the tree in in order, the words would be printed in alphabetical order: apple, banana, cherry, grapes, kiwi, pear.