You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hint 1
Traverse the graph visiting root, left, root, right, root to make an Euler Path
Hint 2
Return the node (LCA) that is at the lowest depth between p and q in the Euler Path