filmov
tv
LeetCode 129 | Sum Root to Leaf Numbers | Solution Explained (Java + Whiteboard)
Показать описание
Running Time: O(N)
Space Complexity: O(H)
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.
An example is the root-to-leaf path 1-2-3 which represents the number 123.
Find the total sum of all root-to-leaf numbers.
Always be pluggin:
Space Complexity: O(H)
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.
An example is the root-to-leaf path 1-2-3 which represents the number 123.
Find the total sum of all root-to-leaf numbers.
Always be pluggin:
0:05:42
0:10:17
0:04:53
0:09:38
0:15:55
0:07:11
0:08:50
0:04:16
0:08:12
0:05:10
0:05:00
0:02:39
0:07:10
0:05:19
0:06:41
0:08:16
0:07:11
0:07:12
0:04:31
0:06:03
0:04:53
0:05:02
0:03:19
0:08:27