This video contains explanation of BINARY TREE PATHS.

Code explanation included.

Time Complexity : O(n) where n is number of nodes.
Space Complexity: O(n) as we can have at most n number of recursive calls in function call stack.

LeetCode Problem Link : https://leetcode.com/problems/binary-...

Timecodes:
00:00 Problem Explanation
01:05 Approach Explanation
03:38 Code Walkthrough and Explanation
06:47 Code Dry Run
09:34 Time and Space Complexity