data structures using while rotationnode becomes the rootwith and as its left and right child and become the left and right sub-trees of example consider the avl tree given in fig and delete from it solution (step - - - (step figure avl tree example solution delete nodes and from the avl tree given in fig (step figure avl tree write program that shows insertion operation in an avl tree #include typedef enum false ,true boolstruct node int valint balancestruct node *left_childstruct node *right_child}struct nodesearch(struct node *ptrint dataif(ptr!=nullif(data valptr search(ptr -left_child,data)else ifdata ptr -valptr search(ptr -right_childdata)return(ptr)struct node *insert (int datastruct node *ptrint *ht_incstruct node *aptr programming example (step - (step (step