LeetCode Experience

#230 Kth Smallest Element in a BST

SWE coding Medium
Sign in to bookmark Original →

Interview Experience

LeetCode #230: Kth Smallest Element in a BST. Difficulty: Medium. Topics: Tree, Depth-First Search, Binary Search Tree, Binary Tree. Asked at Google in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Graph Binary Search Tree Binary Tree Binary Tree Binary Search Heap Depth-First Search Tree

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview
← All Google questions Google Software Engineer Questions → All Binary Tree Questions →