fork download
copy 
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. #define height 4
  5. #define MAX (1<<height)  //ビットシフト演算 2^height と同じ
  6.  
  7. int t[MAX+1]; //配列外アクセス防止のためのダミーで＋１
  8. int sz = 0;
  9.  
  10. void swap(int *x, int *y){
  11.     int tmp = *x;
  12.     *x = *y;
  13.     *y = tmp;
  14. }
  15.  
  16. void initTree(int n){
  17.     int i;
  18.     for(i=0;i<MAX;i++){
  19.         t[i] = -1;
  20.     }
  21. }
  22.  
  23. void printA(){
  24.     int i;
  25.     for(i=1;i<=sz;i++) printf("%d ",t[i]);
  26.     printf("\n");
  27. }
  28.  
  29. void printT(int i){
  30.     int x = i;
  31.     while(x/2!=0){
  32.         printf("  ");
  33.         x/=2;
  34.     }
  35.     printf("%d\n",t[i]);
  36. }
  37.  
  38. int goP(int i){
  39.     if(i/2 == 0) return 0;
  40.     else return i/2;
  41. }
  42.  
  43. int goL(int i){
  44.     if(2*i >= MAX) return 0;
  45.     else return 2*i;
  46. }
  47.  
  48. int goR(int i){
  49.     if(2*i+1 >= MAX) return 0;
  50.     else return 2*i+1;
  51. }
  52.  
  53. void preOrder(int i){
  54.     if(t[i] == -1) return;
  55.     printT(i);
  56.     preOrder(goL(i));
  57.     preOrder(goR(i));
  58. }
  59.  
  60. void inOrder(int i){
  61.     if(t[i] == -1) return;
  62.     inOrder(goL(i));
  63.     printT(i);
  64.     inOrder(goR(i));
  65. }
  66.  
  67. void postOrder(int i){
  68.     if(t[i] == -1) return;
  69.     postOrder(goL(i));
  70.     postOrder(goR(i));
  71.     printT(i);
  72. }
  73.  
  74. void insBT(int x){
  75.     int k,i = 1;
  76.     for(k=0;k<height;k++){
  77.         if(t[i]==-1){
  78.             t[i] = x;
  79.             sz++;
  80.             return;
  81.         }
  82.         if(x < t[i]) i = goL(i);
  83.         else i = goR(i);
  84.     }
  85.     printf("Error : too high -> %d\n",x);
  86. }
  87.  
  88. //先頭の要素を取り出す
  89. //ダウンヒープ
  90. int popHeap() {
  91.     if (sz == 0) {
  92.         printf("heap is empty!\n");
  93.         return -1;
  94.     }
  95.     int top = t[1]; 
  96.     t[1] = t[sz];   
  97.     t[sz] = -1;     
  98.     sz--;
  99.  
  100.     int i = 1;
  101.     while (1) {
  102.         int left = goL(i);
  103.         int right = goR(i);
  104.         int largest = i;
  105.  
  106.         if (left <= sz && t[left] > t[largest]) largest = left;
  107.         if (right <= sz && t[right] > t[largest]) largest = right;
  108.  
  109.         if (largest == i) break;
  110.         swap(&t[i], &t[largest]);
  111.         i = largest;
  112.     }
  113.     return top;
  114. }
  115.  
  116. //末尾に要素を追加する
  117. //アップヒープ
  118. void pushHeap(int x) {
  119.     if (sz >= MAX - 1) {
  120.         printf("heap is full!\n");
  121.         return;
  122.     }
  123.     sz++;
  124.     t[sz] = x;
  125.     int i = sz;
  126.  
  127.     while (i > 1 && t[goP(i)] < t[i]) {
  128.         swap(&t[i], &t[goP(i)]);
  129.         i = goP(i);
  130.     }
  131. }
  132.  
  133. int main(void){
  134.     int i, x, n;
  135.     scanf("%d", &n);
  136.     // 木の初期化
  137.     initTree(n);
  138.     for (i = 0; i < n; i++) {
  139.         scanf("%d", &t[i + 1]);
  140.     }
  141.     sz = n;
  142.  
  143.     // 中間順で表示
  144.     inOrder(1);
  145.  
  146.     // pop
  147.     int a = popHeap();
  148.     printf("pop : %d\n", a);
  149.     inOrder(1);
  150.  
  151.     a = popHeap();
  152.     printf("pop : %d\n", a);
  153.     inOrder(1);
  154.  
  155.     printf("push : 100\n");
  156.     pushHeap(100);
  157.     inOrder(1);
  158.  
  159.     printf("push : 30\n");
  160.     pushHeap(30);
  161.     inOrder(1);
  162.     return 0;
  163. }
  164.  
Success #stdin #stdout 0.01s 5280KB
comments (?)
stdin
copy 
12
89 34 55 13 16 21 32 2 3 4 5 8
stdout
copy 
      2
    13
      3
  34
      4
    16
      5
89
      8
    21
  55
    32
pop : 89
      2
    13
      3
  34
      4
    16
      5
55
    21
  32
    8
pop : 55
      2
    13
      3
  16
      4
    5
34
    21
  32
    8
push : 100
      2
    13
      3
  34
      4
    16
      5
100
    21
  32
    8
push : 30
      2
    13
      3
  34
      4
    16
      5
100
      21
    30
  32
    8
https://ideone.com/DCga9M
language:
C (gcc 8.3)
created:
5 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!