Search⌘ K
Home
Courses
Data Structures for Coding Interviews in JavaScript

Solution: Find the Height of Binary Search Tree

Explore how to find the height of a binary search tree by applying depth-first search techniques. This lesson guides you through recursive traversal to measure the longest path from root to leaf, while understanding the solution's time and space complexity for balanced and unbalanced trees.

We'll cover the following...

Statement

Given the root of a binary search tree, return the height of the tree. The height of the tree is the length of the longest path from the root node to any leaf node in the tree.

Note: The height of an empty tree is 0, whereas the height of a tree with a single node is 1.

Constraints:

  • −104≤-10^{4} \leqNode.data ≤104\leq 10^{4} ...