Merge Two Binary Trees | Live Coding with Explanation | Leetcode - 617

[@abhijitbiradar]

Great video, nicely explained, Thanks

[@AlgorithmsMadeEasy]

Glad it was helpful!

[@sasirekhakumaran141]

The DFS iterative solution should check if the curr[1] ==null before doing curr[0].val+=curr[1].val otherwise we get null pointer exception

[@arindamsamanta1207]

Excellent job Aakansha !!

[@prodiptamondal1758]

Great explanation. A suggestion: Make one video using a drawing tablet, not ppt. Check how it goes. Personally, I think it is better than ppt.

[@AlgorithmsMadeEasy]

Thanks!! We will surely try it!! Thank you for the suggestion!! 😊

[@amrholo4445]

Thanks a lot really thanks

[@aravindyadav9340]

Nice explanation 👍🔥

[@muthuvalli333]

First...😀 After long time guyz...Awesome.

[@AlgorithmsMadeEasy]

Yess! 👍

[@systemforge]

awesome

[@reddyrourkela8589]

Didi is back 🔥🔥🔥

[@pstlvictoras]

hello awesome job, do you also have some courses in order to follow them?

[@AlgorithmsMadeEasy]

Not right now. We just teach on KZbin for now

[@abhiram6087]

underrated video

[@parthmahadik3986]

How is this code working if t1 and t2 are not defined?

[@amrholo4445]

they are defined, they are the parameters passed through the function call