Category: ACM

Algo: COUNTING-SORT(A,B,k) 1. let C[0..k] be a new array 2. for i = 0 to k 3….

code: /* C++ program to find Inorder successor in a BST */ #include<bits/stdc++.h> using namespace std; struct…

code: #include<bits/stdc++.h> using namespace std; struct Node{ int data; struct Node* left; struct Node* right; }; Node*…

Height of a binary tree:   Level Order BFS in Binary Search Tree: #include<bits/stdc++.h> #include<queue> using namespace…

youtube : code: #include<iostream> using namespace std; //Definition of Node for Binary search tree struct BstNode {…

code: #include<bits/stdc++.h> using namespace std; int main() { int t,n,i,a; string s; cin>>t; while(t–) { int c=0;…