write it by C programming and also show the result console sreenshot

Write a program that inputs a line of text, tokenizes the sentence into separate words, inserts the words in a binary search tree. Print the inorder, preorder, and postorder traversals of the tree Four traverse and insertion functions should be implemented: inOrder0, preOrder0, postOrder0, insertNode0 There is a sample code on the blackboard. Enter a sentence: this program inserts strings of different lengths in a tree The preorder traversal is this program inserts different a in of lengths strings tree The inorder traversal is: a different in inserts lengths of program strings this tree The postorder traversal is: a in diffnt engths of inserts strings program tree this