Kth Largest Perfect Binary Subtree
Company: Amazon
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: This question evaluates a candidate's ability to combine tree traversal with structural validation, requiring recognition of perfect binary subtrees and aggregation of their sizes. It tests recursive height/size computation and order-statistic selection over tree-derived data, commonly asked to gauge practical coding skill in tree-based algorithm problems.
