#include using namespace std; struct Node { int data; Node* left; Node* right; Node(int val) { data = val; left = nullptr; right = nullptr; } }; 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 min(Node* node) { // Write your code here } int max(Node* node) { // Write your code here } int sum(Node* node) { // Write your code here } int size(Node* node) { // Write your code here } bool find(Node* node, int data) { // Write your code here } int main() { int n; cin >> n; vector arr(n, 0); for (int i = 0; i < n; i++) { string x; cin >> x; if (x == "n") { arr[i] = -1; } else { arr[i] = stoi(x); } } int data; cin >> data; Node* root = construct(arr); cout << size(root) << "\n" << sum (root) << "\n" << max(root) << "\n" << min(root) << "\n"; if (find(root, data)) { cout << "true" << endl; } else { cout << "false" << endl; } }

Size, Sum, Max, Min, Find In Bst

Related Questions