https://leetcode.com/problems/sum-root-to-leaf-numbers/ Time and space complexity O(n) time | O(n) space — where n is the number of nodes of the binary tree Submission Detail Runtime: 32 ms, faster than 72.26% of Python3 online submissions for Sum ...

Markdown supported · ⌘↵ to post
No responses yet.