LeetCode
Experience
#230 Kth Smallest Element in a BST
Interview Experience
LeetCode #230: Kth Smallest Element in a BST. Difficulty: Medium. Topics: Tree, Depth-First Search, Binary Search Tree, Binary Tree. Asked at Oracle 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 Oracle
1p3a
Oracle Software Engineer 3 Technical Interview, 6 YOE, Rejected, Q3 2025
1p3a
Oracle OCI SMTS Interview Experience with 5 YOE System Design and Coding
1p3a
Oracle OCI IC3 Software Engineer Interview Experience Networking Team
1p3a
Oracle Senior Application Developer Interview Questions and Experience
1p3a
Oracle Senior Software Engineer Technical Phone Interview Throttling Design