Path Sum II | Leetcode 113 | Tree DFS Backtracking | Facebook

Problem Link - leetcode.com/problems/path-su...
Subscribe for more educational videos on data structure, algorithms and coding interviews - czcams.com/users/NareshGupta?s...
Code Repository - github.com/naresh1406/youtube...
Popular Playlists:
Top Interview Questions: • Top Interview Questions
Dynamic Programming: • Dynamic Programming - DP
Graph: • Tree 🌳
Tree: • Tree 🌳
Array: • Array
Binary Search: • Binary Search
Linked List: • Linked List
Stack: • Stack
Backtracking: • Backtracking
Trie: • Trie
Combinations and Permutations: • Combinations and Permu...
Best Time to Buy and Sell Stock: • Best Time to Buy and S...
Intervals Problems: • Intervals Problems
House Rober: • House 🏠 Robber
Top Interview Questions - • Top Interview Questions
May LeetCoding Challenge 2021 Playlist: • May LeetCoding Challen...
April LeetCoding Challenge 2021 Playlist: • April LeetCoding Chall...
March LeetCoding Challenge 2021 Playlist: • March LeetCoding Chall...
February LeetCoding Challenge 2021 Playlist: • February LeetCoding Ch...
January LeetCoding Challenge 2021 Playlist: • LeetCode December Chal...
December LeetCoding Challenge Playlist: • LeetCode December Chal...
November LeetCoding Challenge Playlist: • LeetCode November Chal...
October LeetCoding Challenge Playlist: • LeetCode September Cha...
September LeetCoding Challenge Playlist: • LeetCode September Cha...
August LeetCoding Challenge Playlist: • LeetCode August Challenge
July LeetCoding Challenge Playlist: • LeetCode July Challenge
June LeetCoding Challenge Playlist: • LeetCode June Challenge
May LeetCoding Challenge Playlist: • LeetCode May Challenge
LeetCode Recent Contest ProblemsPlaylist: • Leetcode
Follow me on -
LinkedIn - / nareshiitg
Instagram - / naresh_gupta_
Facebook - / cookcodetravel
Quora - www.quora.com/q/cookcodetravel
#Facebook #Tree #Backtracking #DFS #Recursion #Leetcode #Algorithm #DataStructure #Java #Preparation #NG #nickode #CookCodeTravel #CCT

[@annawilson3824]

I did not get why we need the backtracking part, we add both left and right children of the parent anyways.

[@atul018]

What will be complexity in case of backtracking approach ?

[@mohamedalaayahyaoui6114]

O(n)