Q1. List of nodes find the root node of the tree/Graph.
Q2. Design a DS to support get , put , remove and last used functions.

Verdict : Passed