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

@@ -4,22 +4,26 @@ public Node connect(Node root) {
             return null;
         }
 
-        Node leftMostNode = root;
+        Node curr = root;
 
-        while (leftMostNode.left != null) {
-            Node head = leftMostNode;
+        while (curr != null) {
+            Node next = curr.left;
 
-            while (head != null) {
-                head.left.next = head.right;
+            if (next == null) {
+                break;
+            }
+
+            while (curr != null) {
+                curr.left.next = curr.right;
 
-                if (head.next != null) {
-                    head.right.next = head.next.left;
+                if (curr.next != null) {
+                    curr.right.next = curr.next.left;
                 }
 
-                head = head.next;
+                curr = curr.next;
             }
 
-            leftMostNode = leftMostNode.left;
+            curr = next;
         }
 
         return root;