LeetCode 129 | Sum Root to Leaf Numbers | Solution Explained (Java + Whiteboard)

Описание к видео 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:
Slack Channel: https://join.slack.com/t/xavierelonle...
Github: https://github.com/xavierelon1
Facebook:   / xavier.hollingsworth.3  
Instagram:   / xavierelon  
LinkedIn:   / xavier-hollingsworth-524144127  
Twitter:   / elon_xavier  

Комментарии

Информация по комментариям в разработке

Похожие видео