leetcode

113. Path Sum II

Solution code

Time complexity: O(n)

h = height of tree

Space complexity: O(n h)