Closed Shweta2024 closed 2 years ago
Given the root of a Binary Search Tree and a target number k, return true if there exist two elements in the BST such that their sum is equal to the given target.
@utkarsh006 can you please assign this to me
Sure Assigned :) Appreciated the proper format of making an issue.
Description
Two Sum IV - Input is a BST
Given the root of a Binary Search Tree and a target number k, return true if there exist two elements in the BST such that their sum is equal to the given target.
Code of Conduct