Given a set of parent-child pairs representing a graph, determine if the graph forms a single valid binary tree. You must identify specific errors: E1 (More than 2 children), E2 (Duplicate edges), E3…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.