What is Binary Search Tree

Helpmestudy18 Aug, 2021Education

A binary search tree is also called a sorted Binary tree or ordered binary tree in which data is stored in an organized way. A binary search tree or BTS is a type of binary tree in which every node has a comparable key and an associated value. Each key has to satisfy the condition that it is larger than the keys in all nodes in that node's left subtree and smaller than all the keys in all nodes of the right subtree. Binary search trees are useful for the fast lookup, addition, and subtraction of data and can be used to implement lookup tables and dynamic sets. Binary Search Trees makes the program fast and accurate.