Company question banks are included with the Insider plan.
A binary tree is perfect when every internal node has exactly two children and all leaves are on the same level. A perfect tree of height h (counting edges, so a single node has height 0) has...