Question

what is Binary search tree(BST)​

Answer 1

Answer:

In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree whose internal nodes each store a key greater than all the keys in the node's left subtree and less than those in its right subtree.

Hope it helps you ✨

Answer 2

Answer:

In computer science, a binary search tree, also called an ordered or sorted binary tree, is a rooted binary tree whose internal nodes each store a key greater than all the keys in the node's left subtree and less than those in its right subtree.

Invented: 1960

Invented by: P.F. Windley, A.D. Booth, A.J.T. Colin, and T.N.

Explanation:

mark me as brainliest