Binary Tree Zigzag or Spiral Level Order Traversal | Tree Data Structure playlist C++ | Hello World

[@nitinjha4863]

Thank you so much sir !
Your explanation for level order and zig zag traversal question make me understand the logic clearly.

[@HelloWorldbyprince]

You are most welcome

[@rajchinagundi7498]

I did it on my own after watching your level order video, this felt like a piece of cake

[@HelloWorldbyprince]

Thanks a lot Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@cr7johnChan]

aapke wajah se yeh meh khud kar paya hoon,graph karne ke baad yeh playlist bijli ki speed se ho raha hai

[@UnKnown-id7ih]

Bahot badiya explanation bhiya. 🙏🙏

[@HelloWorldbyprince]

Again thanks dear

[@jalpanpatel5570]

Sir apka solution optimize solution nahi he issme riverse vala extra time lagta he.

[@73-sarthakpandey25]

best explanation and code keep it up

[@HelloWorldbyprince]

Thanks 😌
Keep sharing my channel with your friends and colleagues

[@kanandnaik5677]

dhanyavad bhai

[@HelloWorldbyprince]

Keep learning dost
Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@prakashbarui5070]

vaiiia aap regular vedo dala ki jiye

[@HelloWorldbyprince]

Sure 😃

[@anonymous090]

Thank you Bhaiya

[@akshaykumar192]

Thanks

[@HelloWorldbyprince]

Welcome

[@princemaurya3165]

thanks bro
🙃

[@HelloWorldbyprince]

Welcome 😊

[@tabrezahmed1000]

Why cant we use flag and do the operation of inserting into queue in opposite direction

[@MANISHKUMAR-vn1yh]

thanks Buddy 😁😁😁😁😁😁

[@HelloWorldbyprince]

No problem 👍

[@llo.welc_me]

ai se hi bhaia pen paper se samjhaie
best hein rathen than slide

[@HelloWorldbyprince]

Thanks a lot for supporting me

[@vitaminprotein2217]

maine queue mei jb root push kr rhe the jbhi reverse krke daala by phele right ko fir left ko ,pr iss sol se sre given test case satisfy ho rhe pr bhut sre edge cases miss ho rhe plz highlight the mistake
vector zigzagLevelOrder(TreeNode* root) {
int count=1;
//bfs traversal
vectorans;
//edge case
if(!root) return {};
queueq;
q.push(root);
while(!q.empty()){
count++;
vectortemp;
int size=q.size();
for(int i=0;iright)q.push(node->right);
if(node->left)q.push(node->left);
}
else{
if(node->left)q.push(node->left);
if(node->right)q.push(node->right);
}
temp.push_back(node->val);
count++;
}
ans.push_back(temp);
}
return ans;

[@vanivaishnavi3916]

Waoooò

[@icarus4716]

better and less calc needed
bool flag
each time !flag

[@sarthakgupta1102]

hey in the question they are asking to return a vector not a vector of vector so how to deal with it?

[@anubhav5623]

use
for(auto i : data)
{
ans.push_back(i);
}
and then
return the ans.

[@jayeshnayee6735]

vector to std::vector return ans; how solve this problem

[@HelloWorldbyprince]

kya problem aa rha bro ismee

[@satyamsrivastava1871]

sir issme kya problem aaya hai
vector zigzagLevelOrder(TreeNode* root) {
vector ans;
queue q;
q.push(root);
int level=0;
if(root==NULL)
return ans;
while(1)
{
int size=q.size();
if(size==0)
return ans;
level++;
vectordata;
while(size>0){
TreeNode *temp=q.front();
q.pop();
data.push_back(temp->val);
if(level%2==0)
{
if(temp->right!=NULL)
q.push(temp->right);
if(temp->left!=NULL)
q.push(temp->left);
}
else
{
if(temp->left!=NULL)
q.push(temp->left);
if(temp->right!=NULL)
q.push(temp->right);
}

size--;
}

ans.push_back(data);

}

return ans;
}
@Hello World

[@tonyconor681]

Error arha kya ?