Pergunta de entrevista da empresa Gopuff

Leetcode 257: Given the root of a binary tree, return all root-to-leaf paths in any order.

Resposta da entrevista

Sigiloso

4 de jan. de 2022

I was going to do it iteratively lol. Recursive or iteratively would have been fine (I think iterative would have taken a little more time though), I just forgot my basic skills of keeping track of the nodes I visited.