C programming - create a binary search tree that insert words. compare the words by using their first letter character and make binary search tree. if the first letter of the word is the same put it in the same node. Need to produce Inorder, preorder, postorder traversal.

Printing in traversal

----A node will print intended by 2 x depth of the node the list of strings from the node

Ideas for printing tree with indentations

static void printParseTree(nodeType *rootP,int level) { if (rootP==NULL) return; printf("%*c%d:%-9s ",level*2,' ',level,NodeId.info); // assume some info printed as string printf(" "); printParseTree(rootP->child1,level+1); printParseTree(rootP->child2,level+1); }

xample on the attached image.

9:18 PM Note Sep 5, 2018 8:57:13 PM TOAn n Ben Sen, om Tom