Search
⌘K
Leetcode 1666. Change the Root of a Binary Tree
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Early January, 2025
Mid-level
Given an undirected acyclic connected graph where each node has at most 3 edges, find a node which, when made the root, converts the graph into a binary tree.
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.