notes how many binary trees are possible with three nodes construct binary tree whose in-order and pre-order traversal is given below in-order , , , , , , , , pre-order , , , , , , , , what do you mean by binary treealso explain the various properties of binary tree consider the tree given below(afind the degree of each mode of the tree (bthe degree of the tree (cthe level of each nodes of the tree determine the order in which the vertices of the binary tree given in question no will be visited under(ainorder (bpreorder (cpostorder write program to delete all the leaf nodes of binary tree write method and the corresponding recursive function to count the leaves ( the nodes with both subtrees emptyof linked binary tree write method and the corresponding recursive function to insert an entrypassed as parameterinto linked binary tree if the root is emptythe new entry should be inserted into the roototherwise it should be inserted into the shorter of the two subtrees of the root (or into the left subtree if both subtrees have the same height write function to perform double-order traversal of binary treemeaning that at each node of the treethe function first visits the nodethen traverses its left subtree (in double order)then visits the node againthen traverses its right subtree (in double orderanswersself assessment ( ( ( ( number of children for the node to be deleted lovely professional university