Java simplest solution, 5 lines O(1) space


  • 0
    Z
    public class Solution {
        public void connect(TreeLinkNode root) {
            if(root == null || root.left == null) return;
            root.left.next = root.right;
            if(root.next != null) root.right.next = root.next.left;
            connect(root.left);
            connect(root.right);
        }   
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.