Biggest Perfect Subtree After Removing Nodes - American Express OA Question | OAHelper

Biggest Perfect Subtree After Removing Nodes

Company: American Express

Difficulty: medium

Tree Binary Tree Depth-First Search Dynamic Programming

More American Express OA questions Interview experiences