1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:

int merge(queue *a,queue *b)
{if (isempty(a) == 0 && isempty(b) == 0))
  return 0;
else if isempty(a) != 0 && isempty(b) == 0)
  return a;
else if isempty(a) == 0 && isempty(b) != 0)
  return b;
else return merge((append(b,top(a)),rest(a))
}

1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:

int verzweigungen(textbaum *b)
{
if (b==NULL)
return 0;

else if (b->left == NULL) && (b->right == NULL) 
return 1;

else return (verzweigung(b->left)+verzweigung(b->right)); 

};

1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:

int verzweigungen(textbaum *b)
{
if (b==NULL)
return 0;

else if (b->left == NULL) && (b->right == NULL) 
return 0;

else if (b->left == NULL) || (b->right == NULL) 
return 1;

else return (verzweigung(b->left)+verzweigung(b->right));

1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:

int verzweigungen(textbaum *b)
{
if (b==NULL)
return 0;

else if (b->left == NULL) && (b->right == NULL) 
return 1;

else return 1+(verzweigung(b->left)+verzweigung(b->right)); 

};

1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:

unsigned int min(queue *q)
{ if (q == 0)
return emptyqueue();
else if (head(q)== ) ???
return head(q);

else return min(rest(q));