Search⌘ K
Home
Courses
Data Structures for Coding Interviews in C++

Solution: Find the Height of Binary Search Tree

Understand how to compute the height of a binary search tree by applying a depth-first search traversal. This lesson guides you through recursive traversal techniques, handling empty and single-node trees, and analyzing time and space complexity using C++ implementations.

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} ...