June 24, 2022 · 1 min read
https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1
void leftViewUtil(Node *root, vector<int> &v, int lvl) {
if (root == nullptr)
return;
if (v.size() <= lvl) {
v.push_back(root->data);
}
leftViewUtil(root->left, v, lvl + 1);
leftViewUtil(root->right, v, lvl + 1);
}
vector<int> leftView(Node *root) {
vector<int> v;
leftViewUtil(root, v, 0);
return v;
}