notes tnode *rootkey itemint nroot nullprintf("number of data values:")scanf("% "& )whilen printf("enter the data value")scanf("% "item)insert(rootitem) - printtree(root)task discuss how will you delete node with one child avl tree an avl tree is another balanced binary search tree it takes its name from the initials of its inventors adelsonvelskii and landis an avl tree has the following propertiesthe sub-trees of every node differ in height by at most one level every sub-tree is an avl tree - - herethe height of the tree is height of one subtree is - while that of another subtree of the same node is - differing from each other by just thereforeit is an avl tree inserting node into avl tree inserting node is somewhat complex and involves number of cases implementations of avl tree insertion rely on adding an extra attribute the balance factor to each node this factor indicates whether the tree is left-heavy (the height of the left sub-tree is greater than the right lovely professional university