Размер видео: 1280 X 720853 X 480640 X 360
Показать панель управления
Автовоспроизведение
Автоповтор
Like target for this video is 100! Please do like if you have understood the explanation as well as the code 😄
No One explains better than you Bhai. And I am an M.Tech student and also use to teach students in each class I used to suggest each student to follow you for DSA using JAVA. You are best
Thanks a ton♥️
Thankyou somuch BHaiyaaaa!!!!! :)
nice
understood
great sir
❤
i think there is no need for dfs func if head.val == root.val get true then we will find for head.next in root.left and root.right
same same only fully recurssion only
please tell kmp algorithm Solution.
Sir Time Complexity O(N+M) hoga ya O(N*M)?
(N×M) me bhai
first view reh gaya mera aaj :( chaliye aaj 2nd comment 😛
@@PiyushSharma-we8yd 😂
Like target for this video is 100! Please do like if you have understood the explanation as well as the code 😄
No One explains better than you Bhai. And I am an M.Tech student and also use to teach students in each class I used to suggest each student to follow you for DSA using JAVA. You are best
Thanks a ton♥️
Thankyou somuch BHaiyaaaa!!!!! :)
nice
understood
great sir
❤
i think there is no need for dfs func if head.val == root.val get true then we will find for head.next in root.left and root.right
same same only
fully recurssion only
please tell kmp algorithm Solution.
Sir Time Complexity O(N+M) hoga ya O(N*M)?
(N×M) me bhai
first view reh gaya mera aaj :( chaliye aaj 2nd comment 😛
@@PiyushSharma-we8yd 😂
❤