Build Balanced BST from Sorted Array | C++ Placement Course | Lecture 28.5

[@The_Empire_Vstech]

Error is - expected initializer before. '* ' tolen
This was found in
node * buildbst(int arr[],int start,int end)
{}

[@khokonchandra218]

Awesome explanation

[@satender5389]

Where do we get our queries or doubt solved?
Especially came from this video?

[@hustlewithVaibhav]

Thank you 🙏🙏

[@chirag_me]

bhaiya Nimcet exam preperation kai lie bhi video bana do.... koi bhi content provider nhi hai..... aap hi hit ho jaoge....

[@PIYUSH-lz1zq]

Bro , nimcet clear hogaya ?? Agar Huya/nahi to konsa clg liya ?? Same category se hai

[@chirag_me]

@@PIYUSH-lz1zq bhai abhi 1st sem mein hu... bechlor degree kai

[@TheDailyProphet789]

@@chirag_me mujhe v krni hai pr avi tk smjh ni aayekha senkru

[@princijaiswal2461]

ye question leetcode pe thora change h because sort array to bst wle function mein sirf do hi argument pass h ek *nums aur dusra numsSize

[@vimalslab3398]

ek or function bana k solve kar le

[@sourav_Barbigahiya]

*Thank you Dii*

[@meme_eternity]

we can see inorder for better checking

[@vramanrs]

clear explanation thank you

[@parallax8916]

class Solution {
public:
TreeNode* addNode(int l,int r,vector& nums){
if(l>r) return NULL;
int mid=(l+r)/2;
TreeNode* root=new TreeNode(nums[mid]);
root->left=addNode(l,mid-1,nums);
root->right=addNode(mid+1,r,nums);
return root;
}
TreeNode* sortedArrayToBST(vector& nums) {
return addNode(0,nums.size()-1,nums);
}
};

[@satender5389]

Matlab doubt clear karne ka ya DISCUSSION ka koi telegram channel ya aur kuch hai kya ?

[@meme_eternity]

hain ek

[@satender5389]

@@meme_eternity
Not needed now
Thanks !

[@wecodedaily7777]

Outstanding explanation 🔥

[@techgianttechyforever]

thanks a lot mam

[@devbhattacharya153]

Thanks a lot Maam!!! :)

[@PujaKumari-nt5dq]

Do we have notes for Treee playlist?

[@murapovyerkhan2439]

Strong brothers

[@sgcreations5638]

thanks for such a nice explanation.

[@rishikagandhi]

AVL trees approach ? Won't we used that?

[@foodbankswat]

Anyone have solve this plz...
Write an Array based implementation of BST?
1. Insertion()
2. Deletion()
3. Search()
4. Inorder(), PreOrder(), PostOrder()
5. Height()
6. Write a Function to find the number of nodes at a specific height (given by user).
7. Write a function to count the leaf nodes in a BST......

[@RajveerSingh-pr2ol]

Aman bhaiya note nhi milta hai abhi 😔

[@0x_minato4thh]

bhaiya ye animation bahut funny tha lekin😂😂😂😂😂😂

[@sanketrajgiri3239]

Another name for this problem is "Building a BST from inorder sequence".

[@Npanywayme]

But. Inorder se wo balance nhi hojata

[@Npanywayme]

Compulsory nhi hai ki inorder wala balance tree ho

[@armankang783]

@@Npanywayme usne ye ni bola ki inorder se balance ho jaega, he said build a balanced tree from inorder sequence which is itself a sorted sequence

[@iemmadhav]

Apni kaksha pe bhi content daal do please

[@raunaqsingh875]

Very good explanation

[@ayushshrivastava3838]

bhaiya mai abhi 12 class mai hu mai apneee colege ke first year sai aaapki c++ coading learn kr luga
.

[@StoryGicRohit]

Please Do learn bro .. You wont regret even if you give 1 hr a day you will build a very strong future for you (if you found programming is for you**)

[@sleepypanda7172]

class Solution {
public:
TreeNode* func(TreeNode* &root, int ele)
{
if(!root)
return root= new TreeNode(ele);
if(root->val>ele)
{
root->left= func(root->left,ele);
}
else
{
root->right= func(root->right,ele);
}
return root;
}
TreeNode* bstFromPreorder(vector& preorder) {
TreeNode*root= NULL;
for(auto x:preorder)
{
func(root,x);
}
return root;
}
};

[@kapil4457]

Hello EveryBody...If you are looking for the code..here it is :
TreeNode * ans(vectortrav , int start , int end){
if(start > end){
return NULL;
}
int mid =( start + end) / 2;
int midEle = trav[mid];
TreeNode *root = new TreeNode(midEle);
root->left = ans(trav , start , mid-1);
root->right = ans(trav , mid+1 , end);

return root;
}

//Inorder Traversal
void inorder(TreeNode * root , vector & trav){
if(root==NULL){
return;
}
inorder(root->left , trav );
trav.push_back(root->val);
cout

[@foodbankswat]

Anyone have solve this plz...>
**Write an Array based implementation of BST?
1. Insertion()
2. Deletion()
3. Search()
4. Inorder(), PreOrder(), PostOrder()
5. Height()
6. Write a Function to find the number of nodes at a specific height (given by user).
7. Write a function to count the leaf nodes in a BST......**

[@ritwickrana3255]

i think these videos are getting less likes as i am moving forward in this channel
i guesss this is because students are leaving as course is moving ;

[@The_Empire_Vstech]

Hellow aman bhaya i have got some error exactly same code i have run which has been tought
I have try to find the solution in google but not found. Can u provide me the solution aur why it is happening

[@aakashgoswami2356]

class Solution {
public:
TreeNode* makeBST(vector&nums,int start,int end){
if(start>end)
return NULL;
int mid = (start+end)/2;
TreeNode *root = new TreeNode(nums[mid]);
root->left = makeBST(nums,start,mid-1);
root->right = makeBST(nums,mid+1,end);
return root;
}

TreeNode* sortedArrayToBST(vector& nums) {
TreeNode *res = makeBST(nums,0,nums.size()-1);
return res;
}
};

[@uday6717]

Kya koi bata skta hai ye didi kaun si hai😍😍😍

[@rohanbhatia74]

Shraddha Di..😊

[@sachinbairi6353]

@@rohanbhatia74 insta id?? hai kya

[@melodytunes2204]

@@sachinbairi6353 yr shayad se ye insta nahi chalati kyuki mene dhundne ki kaafi koshish ki thi lekin nhi mili

[@vikashmahli1826]

Bhaiya class 12 jac ka computer science plzzz note video daaliye 🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏😭😭😭😭😭😂😂😂🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏😭😭😭😭😭😭😭😭😭😭😭😭😭😭😂😂😂😂🙏😂🙏😂🙏😂🙏😂🙏😂🙏😂🙏😂🙏😂🙏😂🙏😂🙏😭😭😭😭😭😭😭🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏plzzzzzzzzzzzzzzzzzzz

[@ShivamcseIIITG]

🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏

[@nn_yt24]

You have made a terrible mistake the diagram is wrong...the inorder traversal should be 10,20,30,40,50....and preorder would be 30,20,10,40,50