Binary Search Tree
Elshad Karimov · Apress eBooks · 2020
A binary search tree (BST) is a binary tree in which each node has at most two children, and it facilitates fast search, insertion, and deletion operations. The time complexity of each operation is O(log n), which is considerably faster than linear search. The two main characteristics of the binary search trees are as follows: