132. Kth Smallest Element in a BST

PRO

Medium

Topics

Companies

Hint

Understand Before Coding

Step 1 / 28

Speed: 1.0x

Tree Visualization

Current

In Stack

Visited

Found

Initialize. n = 0, k = 3, cur = root (3).

Variables

k3

n0

stack[]

cur3

visited[]

Loading visualization...

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: root = [3,1,4,null,2], k = 1

Output: 1

Explanation: The inorder traversal is [1, 2, 3, 4]. The 1st smallest element is 1.

Example 2:

Input: root = [5,3,6,2,4,null,null,1], k = 3

Output: 3

Explanation: The inorder traversal is [1, 2, 3, 4, 5, 6]. The 3rd smallest element is 3.

Constraints:

•
•
•

Time Complexity

O(n)

Space Complexity

O(h)

132. Kth Smallest Element in a BST

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

132. Kth Smallest Element in a BST

Understand Before Coding

Variables

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

Variables