Recursively delete leaf nodes until tree is empty
Filed under Arista Networks
The question
Given the root of a binary tree where nodes also maintain a pointer to their parent, repeatedly delete leaf nodes recursively until the entire tree is deleted, and print the order in which nodes are deleted.
No write-up yet. Related questions below have one.
Related Arista Networks questions
Collected from public candidate posts and coding forums. Updated Nov 2026.