Good morning! Here's your coding interview problem for today.
This problem was asked by Facebook.
Given a binary tree, return all paths from the root to leaves.
For example, given the tree:
1
/
2 3
/
4 5
Return [[1, 2], [1, 3, 4], [1, 3, 5]].