INSERT za PRIORITY QUEUE??

[sacy]

Kako bi se napravio INSERT za PRIORITY QUEUE pomocu pointera

_________________
I'm always in trouble...
...but it's so fun!

[vsego]

[sacy]

To me malo muci. Ono sto ja imam napravljeno, vjerojatno je jako zakomplicirano. Javlja mi segmentation fault, no mislim da se i na taj nacin to moze zapisati. No ne znam gdje mi je greska. Puno zahvaljujem, ako se nekome da ovo pogledati.

typedef struct priority
{
elementtype broj;
struct priority *next;
struct priority *left;
struct priority *right;
struct priority *parent;
}PRIORITY_QUEUE;


void INSERT (elementtype x, PRIORITY_QUEUE *root){
PRIORITY_QUEUE *position, *temp;
int found=0, br;

position=root;
if(EMPTY(root)){
root->broj=x;
printf("%d\n", root->broj);
}
else{
printf("nesto\n");
MAKE_NULL(temp);
printf("nesto\n");
temp->broj=x;
printf("%d\n",x);
while(!found){
if(position->left==NULL){
temp->parent=position;
position->left=temp;
found=1;
}
else
if(position->right==NULL){
temp->parent=position;
position->right=temp;
found=1;
}
else position=position->next;
}
position=root;
if (position!=temp){
found=0;
while(!found){
if(position->next!=NULL) position=position->next;
else{
position->next=temp;
found=1;
}
}
}
position=temp;
found=0;
while(!found){
if(position->parent->broj>=position->broj){
br=position->parent->broj;
position->parent->broj=position->broj;
position->broj=br;
position=position->parent;
}
else found=1;

}
}
return;
}

_________________
I'm always in trouble...
...but it's so fun!

[vsego]

Bez detaljne analize...