Untitled

Anonymous
Plain Text
09/13/2025 4:30 PM
226 B
17
Indexable
Never
    /*
    Given a binary tree, convert it in-order to a doubly circularly linked list and return the root head

     4
   /   \
  2     6
 / \   / \
1   3 5   7

(back to 7) <->1<->2<->3<->4<->5<->6<->7<-> (back to 1)
     */
Editor is loading...
Leave a Comment