Merge 2 BST
Approach 1: Using Vector
Time Complexity :- O(n+m)
Space Complexity :- O(n+m)
Self-explanatory Code:-
void inorder(TreeNode<int> *root, vector<int> &in){
if(root == NULL){
return;
}
inorder(root->left, in);
in....
ekta.hashnode.dev2 min read