You are viewing a single comment's thread. Return to all comments →
void topView(Node * root) { vector<int> vL, vR; Node *t = root; while(t){ t = t->left; if(t) vL.push_back(t->data); } t = root; while(t){ vR.push_back(t->data); t = t->right; } for(int i=vL.size()-1; i>=0; i--) cout<<vL[i]<<" "; for(int i=0; i<vR.size(); i++) cout<<vR[i]<<" "; } Can anyone explain why this code doesn't work?
I think you have the same problem as me with what they mean by top-view but I'd like to point out some tiny improvements to your code.
Storing outputs in a vector is a pointless inefficiency. You can cout in your loops instead of pushing the values to a vector that prints after.
Tree : Top View
You are viewing a single comment's thread. Return to all comments →
I think you have the same problem as me with what they mean by top-view but I'd like to point out some tiny improvements to your code.
Storing outputs in a vector is a pointless inefficiency. You can cout in your loops instead of pushing the values to a vector that prints after.