Month: July 2017

best:  

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;…

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

code: #include<bits/stdc++.h> using namespace std; int main() { int zz,oo; string S; string z=”000000″; string o=”111111″; cin>>S;…