Question

Please help with this question! It's only one function. Thank you!

Printing the contents of an AVL tree in breadth-first fashion param: pointer to a tree pre: assume that tree was initialized well before calling this function Vold printBreadthFiřstTree (struct AVITree *tree){ struct AVLnode *queu print using a queue, where queue is implemented as a static array */ struct AVLnode *current = tree->root ; int start-0 start index of queue indicating the first element to be processed/ int end = 0; /* end index of queue indicating the latest element added to the queue /*allocate memory to queque / queue = (struct Avinode **) malloc (100*sizeof (struct Avinode)); / FIX ME/ struct AVLnode val; TYPE struct AVLnode left; struct AVLnode *right; int height;

Answer 1

// A utility function to get the height of the tree
int height(struct AVLnode*N)
{
   if (N == NULL)
       return 0;
   return N->height;
}


// Print nodes at a given level
void printGivenLevel(struct AVLnode* root, int level)
{
if (root == NULL)
return;
if (level == 1)
printf("%d ", root->val);
else if (level > 1)
{
printGivenLevel(root->left, level-1);
printGivenLevel(root->right, level-1);
}
}

//The main function for printing Breadth First traversal or Level order traversal
void printBreadthFirstTree(struct AVLnode* root)
{
int h = height(root);
int i;
for (i=1; i<=h; i++)
printGivenLevel(root, i);
}

PLEASE MAKE SURE TO LIKE THE ANSWER. THANKS SO MUCH IN ADVANCE :)