Update 116_Populating_Next_Right_Pointers_in_Each_Node.java

Author: Sean Prashad

Tree Breadth First Search/116_Populating_Next_Right_Pointers_in_Each_Node.java

@@ -1,25 +1,27 @@
 class Solution {
     public Node connect(Node root) {
-        Node head = root, prev = root;
+        if (root == null) {
+            return null;
+        }
 
-        while (prev != null) {
-            Node curr = prev;
+        Node leftMostNode = root;
 
-            while (curr != null) {
-                if (curr.left != null) {
-                    curr.left.next = curr.right;
-                }
+        while (leftMostNode.left != null) {
+            Node head = leftMostNode;
+
+            while (head != null) {
+                head.left.next = head.right;
 
-                if (curr.right != null && curr.next != null) {
-                    curr.right.next = curr.next.left;
+                if (head.next != null) {
+                    head.right.next = head.next.left;
                 }
 
-                curr = curr.next;
+                head = head.next;
             }
 
-            prev = prev.left;
+            leftMostNode = leftMostNode.left;
         }
 
-        return head;
+        return root;
     }
 }