#include #include #include #include using namespace std; class Node { public: int data; Node* left = nullptr; Node* right = nullptr; Node (int data) { this->data = data; } }; class Pair { Node* node = nullptr; int state = 0; Pair(Node* node, int state) { this->node = node; this->state = state; } }; void pir(Node* node, int d1, int d2) { // write your code here } Node* construct(vector& arr) { Node* root = new Node(arr[0]); pair p = {root, 1}; stack> st; st.push(p); int idx = 1; while (!st.empty()) { if (st.top().second == 1) { st.top().second++; if (arr[idx] != -1) { st.top().first->left = new Node(arr[idx]); pair lp = {st.top().first->left, 1}; st.push(lp); } else { st.top().first->left = nullptr; } idx++; } else if (st.top().second == 2) { st.top().second++; if (arr[idx] != -1) { st.top().first->right = new Node(arr[idx]); pair rp = {st.top().first->right, 1}; st.push(rp); } else { st.top().first->right = nullptr; } idx++; } else { st.pop(); } } return root; } int main() { int n; cin >> n; vector arr(n, 0); for (int i = 0; i < n; i++) { string tmp; cin >> tmp; if (tmp == "n") { arr[i] = -1; } else { arr[i] = stoi(tmp); } } int k1; cin >> k1; int k2; cin >> k2; Node* root = construct(arr); pir(root, k1, k2); }

Print In Range

Related Questions