Given a graph node, write a code to return a copy of the sub-graph starting with that node.
Anonymous
binary tree is not the only type of graph. How would you handle cycles? What about self references etc?
Check out your Company Bowl for anonymous work chats.