(Node n1,Node n2)
| 25 | PriorityQueue<Node> queue=new PriorityQueue<>(new Comparator<Node>() |
| 26 | { |
| 27 | @Override |
| 28 | public int compare(Node n1,Node n2) |
| 29 | { |
| 30 | if(n1.freq==n2.freq) |
| 31 | return 1; |
| 32 | return n1.freq-n2.freq; |
| 33 | } |
| 34 | } |
| 35 | ); |
| 36 | for(int i=0;i<str.length();i++) |
nothing calls this directly
no outgoing calls
no test coverage detected