Binary Search Tree Problems for Coding Round

[@CoderArmy9]

Kaisa laga new concept 👊

[@BholaKumar-xe4eb]

basic to hero concept bhai

[@seekingsoul871]

Bhaiya, aapne timestamp->51:36 pe jo tree tha uska preorder bola tha 1 2 4 , par uska preorder to 2 1 4hoga.

[@Vaibhavvashishtha123]

​@@seekingsoul871haan

[@mrattack2330]

ek number sir

[@ankitshrestha6481]

59:00 Bhaiya aab solution accept ho raha h [gfg]

[@mohit6215]

Coding is not just writing programs its about "LEVEL OF UNDERSTANDING"

[@malaydewari1078]

accha

[@fachoyt9686]

No paid course explains things so clearly and in such depth. I really like the way you teach.

[@ParvezKhan-mj7yt]

I solved problem 3 bst and preorder with array. It produced right result.

[@GuruDonBharati]

Love you Bhaiya Thankyou For Your hardwork main abhi lecture no. 15 par hu late Start Kiya hu But ab Continue Karunga 🇮🇳🇮🇳🚩🇮🇳💯💯🤞🙏🎊🎊🎊

[@VineetDixit]

bhaiya,sach me legendary explanation aur code h aapka

[@Sanataniblood-mb5pu]

Best part is roast GFG 😂😂 Another Awesome lecture bhaiya ❤️❤️

[@Chandan_agrawal]

you are awesome teacher .concept ko hamere level par leja kar samajate hai

[@ankushladani496]

Stack wala part was awesome Bhaiya...♥️🚀

[@étudianteambitieuse]

Thankyou bhaiya !! You are best teacher 😊

[@Eng_wallah]

Bhaiya! You are a great person for teaching

[@CoderArmy9]

Thanks ❤️

[@Noobiee_FPS]

bhaiya aaj ki lecture mai mzaa aa gya new concept toh interesting tha

[@bharatmalik2756]

Bhaiya concept to crystal clear ho gya 🔥

[@rahuldurgapal9859]

1:00:28 ye bat aapne bilkul sahi boli bhayia 🥲🥲

[@allinonemoviesyt]

ek number😍

[@vijaysingh-n6p9j]

Good evening Gurudev😁.

[@shubhtalk7073]

Bhaiya heap jaldi start kariye 👍 BTW love your videos 😊

[@ParvezKhan-mj7yt]

Method 3 construct BST from pre order.. Why it doesn't seem like having time complexity of order(n)

[@Vardanaggarwal]

BAAP level concept bhaiya.

[@heetpatel3037]

Jai shree Ram ❤️ Aapka lakh lakh shukriya

[@ankushladani496]

Done Bhaiya... Day 165/180 ✅

[@Aniruddha_Mukherjee]

Good morning bhaiya ji😍

[@CoderArmy9]

Good morning bhai❤️

[@Eng_wallah]

Radhe radhe bhaiya🙏🏻🙏🏻

[@CoderArmy9]

Radhe Radhe bhai❤️

[@mohit6215]

Bhaiya aaj ekdum bijli wala chamka

[@nikhil316_pspk]

stack aur heap memory ka usage kaise vary karta hai samaj ayaa

[@machinecode2.047]

Maja ageya Dil garden garden horahahe 😂

[@asad_iliyas]

H/W= Node *createBST(int pre[], int size,int &index,int lower,int upper) { if(index==size || pre[index]upper) return NULL; Node *temp = newNode(pre[index++]); temp->left = createBST(pre,size,index,lower,temp->data); temp->right = createBST(pre,size,index,temp->data,upper); return temp; } // Function that constructs BST from its preorder traversal. Node* Bst(int pre[], int size) { // code here int index = 0; return createBST(pre,size,index,INT_MIN,INT_MAX); }

[@parmanandkumarsingh7636]

Love you BHAIYA ❤❤

[@CoderArmy9]

Bhai❤️

[@ankushladani496]

Thanks Bhaiya...❤🎉

[@Pallab01]

4: Preorder to PostOrder: class Solution{ public: //Function that constructs BST from its preorder traversal. Node* makeBst(int pre[],int &index,int lower,int upper,int size) { if(index==size||pre[index]>upper||pre[index]left=makeBst(pre,index,lower,root->data,size); // build right side root->right=makeBst(pre,index,root->data,upper,size); return root; } Node* post_order(int pre[], int size) { //code here int index=0; return makeBst(pre,index,INT_MIN,INT_MAX,size); } };

[@AMITKUMAR-ds4hp]

Good morning boss ❤❤❤

[@CoderArmy9]

Good morning bhai❤️

[@lucifersamrat6280]

is nexus is going to be taught on this board bhaiya

[@PankajBabu01]

Thank you Bhai ❤❤❤

[@utkarshrathore2990]

😇😇

[@AakashParvani]

Good morning bhaiya ❤

[@CoderArmy9]

Good morning bhai❤️

[@arceus9t376]

Great ❤

[@YashSaini007]

Bhaiya Radhe Radhe 🙏

[@CoderArmy9]

Radhe Radhe bhai❤️

[@AshokKumar-sl9fo]

Mera segmentation fault nhi aaya

[@sabiruddinkhan496]

SOLUTION FOR QUESTION NO. 3 USING STACK: class Solution { public: int canRepresentBST(int arr[], int N) { stacklower; stackupper; lower.push(INT_MIN); upper.push(INT_MAX); int index=0; while(indexlower.top() && arr[index]

[@binauralbeats-relaxingmusi4336]

Dsa notes me page no 35 me. Num=0; Cout

[@CoderArmy9]

Kunse DSA Notes bhai, humare koi DSA notes nahi hai

[@binauralbeats-relaxingmusi4336]

@@CoderArmy9 1044 pages wale

[@binauralbeats-relaxingmusi4336]

kzbin.info/www/bejne/e6rTgaCXmL97j7ssi=ZheOxN_OHmmTMF5p

[@binauralbeats-relaxingmusi4336]

Ye Wale notes

[@gajendrasinghdhaked]

😍

[@shubhamtiwari9817]

good morning bheji ❤

[@CoderArmy9]

Good morning bhai❤️

[@sejalgoyal5386]

commendable

[@iamalcohishan106]

🎉🎉🎉🎉

[@CoderArmy9]

❤️

[@YASHYADAV-f9i]

bhaiya maja aa gaya

[@yadiencollection5073]

Ram Ram bhaiya

[@CoderArmy9]

Ram Ram bhai❤️

[@adarsh_kumar_sharma_8638]

Bhaiya aaj ekdum chamka bhaya is ka pdf ya notes bhi ho sakta hai to bana do ya code link

[@zafrul_islam]

✅✅✅✅

[@Rahul-cn8bq]

sab samjh gaya

[@YashSaini007]

Day 167/180 #180DaysOfCode

[@itshirdeshk]

Day 167 ✅🔥

[@nitinverma1902]

Good morning bhaiya, I'm unable to join the discord server again unfortunately by mistake I exit the server. Your discord link is showing expired. Please fix this problem 🙏

[@CoderArmy9]

Bhai website mein jaao, udhr chat section mein link diya hai, join kar lo

[@dayashankarlakhotia4943]

problem no.3 code. class Solution { static int can RepresentBST(int arr[],int N){ Stackst=new Stack(); int root=Integer.MIN_VALUE; for(int i=0;i

[@TotalEasyMath]

jai hind bhiya

[@CoderArmy9]

❤️

[@dayashankarlakhotia4943]

problem no.4 ka code. static Node buildTree(int[]pre,int[]i,int size,int max){ if(i[0]==size||pre[i[0]]>=max) return null; Node root=new Node(pre[i[0]++]); root.left =buildTree(pre,i,size,root.data); root.right =buildTree(pre,i,size,max); return root; } public static Node post_order(int pre[],int size){ int[]i=new int[1]; return buildTree(pre,i,size,Integer.MAX_VALUE); } Tc=0(n); sc=0(1); 🎉❤

[@VineetDixit]

matlab koi map wap use nhi kiya aur binary tree chamka diya,wahhhhh

[@shubhamkumarjha9192]

Good morning bhaiya ji. 💖

[@CoderArmy9]

Good morning bhai❤️