Practice TikTok Coding Question | Real Coding Interviews | Hack2hire

NewThe Learning module is now liveSee what's new

Question Bank Learning

Pricing Blog Forum

Quick Summary

Balance all root-to-leaf path latencies in a perfect binary tree by only increasing edge weights.
Minimize the total additional latency added across all edges to achieve uniform leaf depth.
The tree structure is implicitly defined using standard binary heap indexing rules.

What This Tests

Post-order tree traversal
Greedy subtree balancing
Recursive state accumulation
Implicit array-to-tree mapping

Common Patterns

DFS/BFS

Greedy

Accepted

2.3k/4.2k

Acceptance Rate53.4%

Test Cases

Input

n =

latency =

Output

Expected