feat: update queue methods for node traversal (#4823)

Author: waitpersistence

solution/0100-0199/0117.Populating Next Right Pointers in Each Node II/README.md

@@ -148,20 +148,20 @@ class Solution {
             return root;
         }
         Deque<Node> q = new ArrayDeque<>();
-        q.offer(root);
+        q.offerLast(root);
         while (!q.isEmpty()) {
             Node p = null;
             for (int n = q.size(); n > 0; --n) {
-                Node node = q.poll();
+                Node node = q.pollFirst();
                 if (p != null) {
                     p.next = node;
                 }
                 p = node;
                 if (node.left != null) {
-                    q.offer(node.left);
+                    q.offerLast(node.left);
                 }
                 if (node.right != null) {
-                    q.offer(node.right);
+                    q.offerLast(node.right);
                 }
             }
         }

solution/0100-0199/0117.Populating Next Right Pointers in Each Node II/README_EN.md

@@ -146,20 +146,20 @@ class Solution {
             return root;
         }
         Deque<Node> q = new ArrayDeque<>();
-        q.offer(root);
+        q.offerLast(root);
         while (!q.isEmpty()) {
             Node p = null;
             for (int n = q.size(); n > 0; --n) {
-                Node node = q.poll();
+                Node node = q.pollFirst();
                 if (p != null) {
                     p.next = node;
                 }
                 p = node;
                 if (node.left != null) {
-                    q.offer(node.left);
+                    q.offerLast(node.left);
                 }
                 if (node.right != null) {
-                    q.offer(node.right);
+                    q.offerLast(node.right);
                 }
             }
         }

solution/0100-0199/0117.Populating Next Right Pointers in Each Node II/Solution.java

@@ -27,20 +27,20 @@ public Node connect(Node root) {
             return root;
         }
         Deque<Node> q = new ArrayDeque<>();
-        q.offer(root);
+        q.offerLast(root);
         while (!q.isEmpty()) {
             Node p = null;
             for (int n = q.size(); n > 0; --n) {
-                Node node = q.poll();
+                Node node = q.pollFirst();
                 if (p != null) {
                     p.next = node;
                 }
                 p = node;
                 if (node.left != null) {
-                    q.offer(node.left);
+                    q.offerLast(node.left);
                 }
                 if (node.right != null) {
-                    q.offer(node.right);
+                    q.offerLast(node.right);
                 }
             }
         }