Properties

In this lesson, we'll discuss a few properties of BST due to their structure.

We'll cover the following

Min value node

For every node, the left key is smaller, and the right key is greater. If we keep traversing left for each node starting from the root, the leaf we reach is the smallest value node in the entire BST.

Time Complexity: In the case of a skewed tree, the height of the tree is NN. The time Complexity to find the minimum node is O(N)O(N)

Get hands-on with 1200+ tech skills courses.