Understanding a binary search tree
A binary search tree is a data structure that utilizes the two-dimensional structure of binary trees by exploiting the fact that we can impose some conditions on who gets to be the left and right child of a node. The nodes in a binary search tree follow a particular order, making it extremely efficient.
Loading Image
Representation of a binary search tree
The special ordering that nodes in a binary search tree follow makes insertion, deletion, and searching extremely fast compared to a generic binary tree.
Liking the course? Check our discounted plans to continue learning.