Given a binary tree whose nodes are digits 0–9, compute the sum of all integers formed by concatenating digits along each root-to-leaf path (e.g., 1→2→3 represents 123); tree size ≤1000 and depth ≤10.
Use esses exemplos para entender em que contexto ela costuma cair e adaptar sua prática.
Sum Root to Leaf Numbers with a variation: If a root-to-leaf path has an even number of negative nodes, add the generated number to the overall sum. If the path has an odd number of negative nodes, subtract the generated number from overall sum.
Nenhum anexo público associado a esta pergunta.
No app você encontra perguntas parecidas, compara empresas e aprofunda essa busca com mais filtros.
