Question Details
LeetCode #653: Two Sum IV - Input is a BST. Difficulty: Easy. Topics: Hash Table, Two Pointers, Tree, Depth-First Search, Breadth-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
Breadth-First Search
Depth-First Search
Tree
Arrays
Binary Search
Binary Tree
Graph
Hash Table
Two Pointers