TreeNode rightNext(){
            TreeNode head = queue.poll();
            if (head.right != null)
                queue.offer(head.right);
            if (head.left != null)
                queue.offer(head.left);
            return head;
        }