chap binary trees prints the rootthen all nodes of level then all nodes of level and so on hintpreorder traversals make use of stack through recursive calls consider making use of another data structure to help implement the levelorder traversal write recursive function that returns the height of binary tree write recursive function that returns count of the number of leaf nodes in binary tree assume that given bst stores integer values in its nodes write recursive function that sums the values of all nodes in the tree assume that given bst stores integer values in its nodes write recursive function that traverses binary treeand prints the value of every node who' grandparent has value that is multiple of five write recursive function that traverses binary treeand prints the value of every node which has at least four great-grandchildren compute the overhead fraction for each of the following full binary tree implementations (aall nodes store datatwo child pointersand parent pointer the data field requires four bytes and each pointer requires four bytes (ball nodes store data and two child pointers the data field requires sixteen bytes and each pointer requires four bytes (call nodes store data and parent pointerand internal nodes store two child pointers the data field requires eight bytes and each pointer requires four bytes (donly leaf nodes store datainternal nodes store two child pointers the data field requires eight bytes and each pointer requires four bytes why is the bst property defined so that nodes with values equal to the value of the root appear only in the right subtreerather than allow equal-valued nodes to appear in either subtree (ashow the bst that results from inserting the values and (in that order(bshow the enumerations for the tree of (athat result from doing preorder traversalan inorder traversaland postorder traversal draw the bst that results from adding the value to the bst shown in figure ( draw the bst that results from deleting the value from the bst of figure ( write function that prints out the node values for bst in sorted order from highest to lowest