Binary Tree Paths · Coding Interview Practice

Binary Tree PathsGiven the root of a binary tree, return all root-to-leaf paths in any order, each written as node values joined by "->".Constraints

The tree has between 1 and 100 nodes

-100 <= Node.val <= 100

Examples

Input: root = [1, 2, 3, null, 5] Output: ["1->2->5", "1->3"]

Input: root = [1] Output: ["1"]

LetsDiscuss

Loading your session…