Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- vector <int> a = {0};
- void insert(int ele){
- int temp;
- a.push_back(ele);
- long last = a.size()-1;
- while(a[last] > a[last/2] && last > 1){
- temp = a[last];
- a[last] = a[last/2];
- a[last/2] = temp;
- last = last/2;
- }
- }
- int main(){
- insert(30);
- insert(20);
- insert(15);
- insert(5);
- insert(10);
- insert(12);
- insert(6);
- insert(40);
- for(int i=1;i<a.size();i++){
- cout << a[i] << " "; // Use Treevis command line tool to visualize the tree
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement