Grokking Data Structures & Algorithms for Coding Interviews
Ask Author
Back to course home

0% completed

Vote For New Content
Singh Singh
Time complexity of insertNum could be N*log(n)

Singh Singh

Jan 1, 2025

Time complexity of insertNum could be N*log(n) as it's called N times and each time it takes log(n) where n is the number of elements in heap.

Please explain if I'm wrong

0

0

Comments
Comments

On this page