red s prioritetom (nedovršeno)

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

typedef struct _cvor* Position;
typedef struct _cvor
{
    int broj;
    int prioritet;
    Position next;
}Cvor;

int Push(Position);
int Pop(Position);
void Ispis(Position);
Position GenerirajClan(int, int);
int DodajNaPocetak(Position, Position);
int DodajSortiranoPoPrioritetu(Position, Position);

int main()
{
    Cvor niz;
    int unos = 0;
    srand((unsigned)time(NULL));

    niz.next = NULL;

    while (unos != 4)
    {
        printf("Unesite 1 za push, 2 za pop, 3 za ispis liste, 4 za prekid: ");
        scanf(" %d", &unos);

        if (unos == 1)
            Push(&niz);
        else if (unos == 2)
            Pop(&niz);
        else if (unos == 3)
            Ispis(niz.next);
        else if (unos != 4)
            printf("Pogresan unos!\n");
    }

    return 0;
}

int Push(Position head)
{
    int temp, tempPrioritet;
    temp = rand() % (100 - 10 + 1) + 10;
    tempPrioritet = rand() % (5 - 1 + 1) + 1;
    DodajSortiranoPoPrioritetu(head, GenerirajClan(temp, tempPrioritet));
    return 0;
}

int Pop(Position head)
{
    head->next = head->next->next;
    return 0;
}

Position GenerirajClan(int broj, int prioritet)
{
    Position noviCvor;
    noviCvor = (Position)malloc(sizeof(Cvor));
    noviCvor->broj = broj;
    noviCvor->prioritet = prioritet;
    noviCvor->next = NULL;

    return noviCvor;
}

int DodajSortiranoPoPrioritetu(Position head, Position novi)
{
    while (head->next != NULL && head->prioritet < head->next->prioritet)
        head = head->next;

    novi->next = head->next;
    head->next = novi;
    return 0;
}

void Ispis(Position position)
{
    while (position->next != NULL)
    {
        printf("Broj: %d ", position->broj);
        printf("Prioritet: %d \n", position->prioritet);
        position = position->next;
    }
    printf("\n");
}