notes explanation this program first creates binary tree with specified number of nodes with their respective data values it then takes the data value of the node to be deletedobtains pointer to the node containing that data valueand obtains another pointer to the root of the node to be deleted depending on whether the node to be deleted is root nodea node with two children node with only one childor node with no childrenit carries out the manipulations as discussed in the section on deleting node after deleting the specified nodeit returns the pointer to the root of the tree input the number of nodes that the tree to be created should have the data values of each node in the tree to be created the data value in the node to be deleted output the data values of the nodes in the tree in inorder before deletion the data values of the nodes in the tree in inorder after deletion question write program to count the number of non-leaf nodes of binary tree application of binary search tree prominent data structure used in many systems programming applications for representing and managing dynamic sets average case complexity of searchinsertand delete operations is (log )where is the number of nodes in the tree one of the applications of binary search tree is the implementation of dynamic dictionary dictionary is an ordered list which is required to be searched frequentlyand is also required to be updated (insertions and deletionsfrequently hence can be very well implemented using binary search treeby making the entries of dictionary into the nodes of binary search tree more efficient implementation of dynamic dictionary involves considering key to be sequence of charactersand instead of searching by comparison of entire keyswe use these characters to determine multi-way branch at each stepthis will allow us to make -way branching according the first letterfollowed by another branch according to the second letter and so on program to create binary search treegiven list of identifiers is given belowchar key[maxlen]struct tnode key nametnode *lchildtnode *rchildvoid btree( lovely professional university