Interview Experience
LeetCode #669: Trim a Binary Search Tree. 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
Binary Search Tree
Binary Tree
Depth-First Search
Tree
Binary Search
Binary Tree
Graph