Given the root of a binary tree, return all paths from the root to the leaf nodes in any order. Each path should be represented as a string of node values, separated by arrows (→), where a leaf is defined as a node with no children.

Constraints:

• $1\leq$ nodes $\leq 100$

• $-10^4\leq$ nodes.data $\leq10^4$