Question

What is a binary search tree in datastructures?

Answer 1

Hey mate ^_^

=======
Answer:
=======

Binary Search Tree is a node-based binary tree data structure which has the following properties: The left subtree of a node contains only nodes with keys lesser than the node's key.

#Be Brainly❤️

Answer 2

Answer-

A binary search tree (BST) is a binary tree where each node has a Comparable key (and an associated value) and satisfies the restriction that the key in any node is larger than the keys in all nodes in that node's left subtree and smaller than the keys in all nodes in that node's right subtree.