79588236

Date: 2025-04-23 09:14:31
Score: 2.5
Natty:
Report link

It cost O(nlogn) to build a AVL Tree
and O(n) to build a binary heap using sink-based heap construction

Reasons:
  • Low length (1):
  • No code block (0.5):
  • Low reputation (1):
Posted by: Sebastian YU