Skip to content

Leftist Heap: Operation

Declaration

image-20241006205105065

Merge

image-20241006205522857

  • time compexity: \(O(\log(N))\)

DeleteMin

  • Delete the root
  • Merge the two subtrees

The time complexity is \(O(\log(N))\)

Problem

1

image-20241006212000426

C.

根据操作一步步来就好了

2

image-20241006212040312

D.

与上一题一样，只需要进行操作就好了