notes the leftthen make your new element as the left child of that current element or else compare it with the existing left child and follow the same rule exactlythe same has to done for the case when your new element is greater than the current element in the tree but this time with the right child though this logic is followed for the creation of binary treethis logic is often suitable to search for key value in the binary tree algorithm for the implementation of binary tree step- if value of new element current elementthen go to step- or else step- step- if the current element does not have left sub-treethen make your new element the left child of the current elementelse make the existing left child as your current element and go to step- step- if the current element does not have right sub-treethen make your new element the right child of the current elementelse make the existing right child as your current element and go to step- task "if binary tree is complete binary treeit can be represented using an array capable of holding elements where is the number of nodes in complete binary tree discuss lab exercise programdepicts the segment of code for the creation of binary tree struct node struct node *leftint valuestruct node *right}create_tree(struct node *currstruct node *new if(new->value valueif(curr->left !nullcreate_tree(curr->leftnew)else curr->left newelse if(curr->right !nullcreate_tree(curr->rightnew)else lovely professional university