Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- struct elem {
- int key;
- elem* left;
- elem* right;
- } *root = NULL;
- int maxElement;
- void add(int n, elem *&t);
- void getMaxElement(elem *t);
- void main()
- {
- int broj = 0;
- while(broj < 1)
- {
- cout << "Broj elementi: ";
- cin >> broj;
- if(broj < 1)
- {
- cout << "Nevaliden broj" << endl;
- }
- else
- {
- break;
- }
- }
- int number;
- cout << "Vavedete elementi: " << endl;
- for (int i = 0; i < broj; i++)
- {
- cin >> number;
- add(number, root);
- }
- maxElement = root->key;
- getMaxElement(root);
- cout << "Maksimalniq element: " << maxElement << endl;
- }
- void add(int n, elem *&t) //dobavqne na listo
- {
- if(t == NULL)
- {
- t = new elem;
- t->key = n;
- t->left = t->right = NULL;
- }
- else
- {
- if(t->key < n)
- {
- add(n, t->right);
- }
- else
- {
- add(n, t->left);
- }
- }
- }
- void getMaxElement(elem *t)
- {
- if(t)
- {
- if(t->key > maxElement)
- {
- maxElement = t->key;
- }
- getMaxElement(t->left);
- getMaxElement(t->right);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment