Low Level Design, Object Oriented, Graph Data Structure, Hashmap, Interview Questions.
only). Note that how this process is recursive because now we are also deleting other entities which were only dependent on X. Graph — Remove all edges going out to and coming in from other nodes to X. If after removal of the edges, any node which is an “orphan” node with no outgoing or incoming