Introduction to Binary Search Tree

A binary search tree (BST) is a representation of data in a tree structure. (Reading time: 1 minute)

In a binary search tree, the left child node is always smaller than the parent, and the right child is always greater than the parent, i.e., left child < parent node < right child

Get hands-on with 1200+ tech skills courses.