Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

Python ✅ Mathematics Virtusa exam @Coding_000

Pattern of  0's and 1's code Virtusa exam @Coding_000

Virtusa 2nd Round Scooby Code @Coding_000

mind tree all completed @Coding_000

mind tree exam done 😊 @Coding_000

Mindtree  slots available ✅✌️ For Sep 4th slots only message me 100% clearance garenteee 🤩✅ NOTE -PAID😁 Contact - @ILOVEU_000

✅Anyone having tomorrow tcs exam. ???????? @Coding_000

varsha code -c++ virtusa @Coding_000

✅Guys I am not getting any  questions Please please ✅Post your coding questions here in this group https://t.me/+TF1M5QbSkTEwNjA1 https://t.me/+TF1M5QbSkTEwNjA1

so please share our channel 😁 @Coding_000 All virtusa solutions provided ✅Share✅Share✅Share ✅share✅ MAKE 2.5K😍

#include<iostream> #include<cmath> using namespace std; struct bst { int data; bst *left; bst *right; }; bst* insert(bst *root, int x) { if(root==0) { bst *root=new bst(); root->data=x; root->left=root->right=0; return root; } if(x<=root->data) root->left=insert(root->left,x); else if(x>root->data) root->right=insert(root->right,x); return root; } int max_kill(bst *root) { if(root==0) return -1; return max(max_kill(root->left),max_kill(root->right))+1; } int main() { int t,n,x; cin>>t; for(int j=1; j<=t; j++) { cin>>n; bst *root=0; for(int i=1; i<=n; i++) { cin>>x; root=insert(root,x); } int result=max_kill(root)+1; if(result==-1) cout<<"0"; else cout<<result; cout<<endl; } return 0; } Martin code -c++ @Coding_000

hari code virtusa @Coding_000

Akash and varun code -python virtusa @Coding_000

so please share our channel 😁 @Coding_000 All virtusa solutions provided ✅Share✅Share✅Share ✅share✅ MAKE 2.5K😍

samatha code -python virtusa neural hack @Coding_000

kamran code -java virtusa share our channel guys @Coding_000

virtusa neural hack -rahul code -c++ @Coding_000

so please share our channel 😁 @Coding_000 All virtusa solutions provided ✅Share✅Share✅Share ✅share✅ MAKE 2.5K😍