Sum Root to Leaf Numbers | Recursion | Leetcode #129

This video explains a very important recursion based programming interview problem which is to find the sum of all the numbers formed from a root to leaf path traversal of a binary tree.In this problem, we are given a binary tree and we need to traverse from root to leaf and then form a number.Likewise, repeat the path traversals and form all possible numbers from root to leaf.Finally, find the sum of all these numbers formed and return as answer.I have shown how we can solve this problem using recursion or dfs (depth first search).I have also shown the code walk through at the end of the video.CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

=================================================================
INSTAGRAM: https://www.instagram.com/surya.pratap.k/
LinkedIn: https://www.linkedin.com/in/surya-pratap-kahar-47bb01168
WEBSITE: https://techdose.co.in/
=================================================================

CODE LINK: https://gist.github.com/SuryaPratapK/ab81c400e8ffea24f44b562ab1b5b51e
OTHER PROOBLEMs:-
Cousins in a binary tree: https://youtu.be/UyxnGWMvxwc
Invert Binary Tree: https://youtu.be/_i0jqdVkObU
Search in a Binary Search Tree: https://youtu.be/Lr2oxJlnLMM
Count Complete Tree Nodes: https://youtu.be/CvrPf1-flAA

Видео Sum Root to Leaf Numbers | Recursion | Leetcode #129 канала TECH DOSE