• Discover
  • Collections
  • Board
  • Create
  • Profile
  • Settings
Paths

L51. Two Sum In BST | Check if there exists a pair with Sum K

L51. Two Sum In BST | Check if there exists a pair with Sum K

Course Content

0% Complete0/315 Lessons

Don't watch my A2Z DSA Course

How to setup VS code for DSA and CP | Input / Output split format

C++ Basics in One Shot - Strivers A2Z DSA Course - L1

Time and Space Complexity - Strivers A2Z DSA Course

Complete C++ STL in 1 Video | Time Complexity and Notes

Solve any Pattern Question - Trick Explained | 22 Patterns in 1 Shot | Strivers A2Z DSA Course

Hashing | Maps | Time Complexity | Collisions | Division Rule of Hashing | Strivers A2Z DSA Course

Basic Maths for DSA | Euclidean Algorithm | Strivers A2Z DSA Course

L39. Introduction to Binary Search Tree | BST

L40. Search in a Binary Search Tree | BST | C++ | Java

L41. Ceil in a Binary Search Tree | BST | C++ | Java

L42. Floor in a Binary Search Tree | BST | C++ | Java

L43. Insert a given Node in Binary Search Tree | BST | C++ | Java

L44. Delete a Node in Binary Search Tree | BST | C++ | Java

L45. K-th Smallest/Largest Element in BST

L46. Check if a tree is a BST or BT | Validate a BST

L47. LCA in Binary Search Tree

L48. Construct a BST from a preorder traversal | 3 Methods

L49. Inorder Successor/Predecessor in BST | 3 Methods

L50. Binary Search Tree Iterator | BST | O(H) Space

L51. Two Sum In BST | Check if there exists a pair with Sum K

L52. Recover BST | Correct BST with two nodes swapped

L53. Largest BST in Binary Tree

Course Content

0% Complete0/315 Lessons

Don't watch my A2Z DSA Course

How to setup VS code for DSA and CP | Input / Output split format

C++ Basics in One Shot - Strivers A2Z DSA Course - L1

Time and Space Complexity - Strivers A2Z DSA Course

Complete C++ STL in 1 Video | Time Complexity and Notes

Solve any Pattern Question - Trick Explained | 22 Patterns in 1 Shot | Strivers A2Z DSA Course

Hashing | Maps | Time Complexity | Collisions | Division Rule of Hashing | Strivers A2Z DSA Course

Basic Maths for DSA | Euclidean Algorithm | Strivers A2Z DSA Course

L39. Introduction to Binary Search Tree | BST

L40. Search in a Binary Search Tree | BST | C++ | Java

L41. Ceil in a Binary Search Tree | BST | C++ | Java

L42. Floor in a Binary Search Tree | BST | C++ | Java

L43. Insert a given Node in Binary Search Tree | BST | C++ | Java

L44. Delete a Node in Binary Search Tree | BST | C++ | Java

L45. K-th Smallest/Largest Element in BST

L46. Check if a tree is a BST or BT | Validate a BST

L47. LCA in Binary Search Tree

L48. Construct a BST from a preorder traversal | 3 Methods

L49. Inorder Successor/Predecessor in BST | 3 Methods

L50. Binary Search Tree Iterator | BST | O(H) Space

L51. Two Sum In BST | Check if there exists a pair with Sum K

L52. Recover BST | Correct BST with two nodes swapped

L53. Largest BST in Binary Tree