A Binary Search Tree and an AVL are compared and contrasted. In your conversation, take operational efficiency into account.

Please explain Some engineers at Google want you to implement a graph structure of the subway system in Boston showing the connections between each station.They are wondering what data structure to use to represent the graph and use the least amount of memory, given that most stations do not connect to many other stations. Which graph data structure representation should you use and why? Group of answer choices a.  Adjacency List -- Because the complexity is O(V+E), the data structure is better at representing sparse graphs since their are fewer connections.   b. Adjacency Matrix -- Because the complexity is O(V+E), the data structure is better at representing sparse graphs since their are fewer connections.

Question Threei. With the aid of a diagram, differentiate between Directed Graph and WeightedGraph.ii. Convert the following infix strings to suffix string using the Reverse PolishNotation (RPN).   i. A + (B * C) / D = M – N * P;   ii. U = P*Q*R /( K+J);   iii. I = P*Q* R* (V +D);