Insertion of N elements in heap of size takes O(nlogn) can you explain why it is O(nlogk) here? https://leetcode.com/problems/merge-k-sorted-lists/\n\nHow do you proceed with the calculation? I understand it is stated as O(logn) but in some cases we do O(logk). Is it depended on the levels?

Insertion of N elements in heap of size takes O(nlogn) can you explain why it is O(nlogk) here? https://leetcode.com/problems/merge-k-sorted-lists/\n\nHow do yo