Updates second minimum node in binary tree

Author: anishLearnsToCode

src/SecondMinimumNodeInBinaryTree.java

@@ -7,7 +7,7 @@ public class SecondMinimumNodeInBinaryTree {
     public int findSecondMinimumValue(TreeNode root) {
         Set<Integer> elements = treeToSet(root);
         if (elements.size() < 2) return -1;
-        Queue<Integer> queue = setToMinHeap(elements);
+        Queue<Integer> queue = new PriorityQueue<>(elements);
         queue.poll();
         return queue.peek();
     }
@@ -24,12 +24,4 @@ private static void addTreeNodesToSet(TreeNode root, Set<Integer> set) {
         addTreeNodesToSet(root.left, set);
         addTreeNodesToSet(root.right, set);
     }
-
-    private static Queue<Integer> setToMinHeap(Set<Integer> elements) {
-        Queue<Integer> queue = new PriorityQueue<>();
-        for (int element : elements) {
-            queue.add(element);
-        }
-        return queue;
-    }
 }