It's a Data Structures Course

4 a. Is the tree labeled A above a valid AVL tree? Answer YES or NO. If NO, add new edge(s) and node(s) to the graph above to make it a valid AVL tree. Add only as few nodes and edges as required to make it valid b. Is the tree labeled B above a valid AVL tree? Answer YES or NO. If NO, add new edge(s) and node(s) to the graph above to make it a valid AVL tree. Add only as few nodes and edges as required to make it valid. c. Is the tree labeled C above a valid AVL tree? Answer YES or NO. If NO, add new edge(s) and node(s) to the graph above to make it a valid AVL tree. Add only as few nodes and edges as required to make it valid. d. Is the tree labeled D above a valid AVL tree? Answer YES or NO. If NO, add new edge(s) and node(s) to the graph above to make it a valid AVL tree. Add only as few nodes and edges as required to make it valid