/* this displays the tree in breadth-first order using additional queue data structure */

void iterative_bf_display(TNODE *root); /* this does the breadth-first search */ TNODE *iterative_bf_search(TNODE *root, int val); /* this does the depth-first search */ TNODE *iterative_df_search(TNODE *root, int val);

I need help implementing a code for the three above my .h is already made i just need help implementing it for the .c