Burning Tree || Maximum Path Sum between 2 Special Nodes

Опубликовано: 18 Февраль 2026
на канале: Coder Army
24,000
917

Trees | Binary Tree | Data Structure and Algorithm | 180daysofcode

1: Burning Tree : https://geeksforgeeks.org/problems/bu...
2: Maximum Path Sum between 2 Special Nodes1: https://www.geeksforgeeks.org/problem...

00:00 Introduction
00:27 Problem 1 - Burning Tree
17:53 Solution 2 - Burning Tree
43:29 Time Complexity of Problem 1
43:58 Code Part - Burining Tree
52:43 Problem 2 - Max Path Sum Between Two Nodes
1:14:02 Discussing Edge Cases of Problem 2
1:17:52 Code Part - Max Path Sum Between Two Nodes
1:26:29 Last Note


Home work sheet: https://drive.google.com/drive/folder...
Join Our Whatsapp Channel: https://whatsapp.com/channel/0029Va6H...

Day 161/180, #180daysofcode #180 hard

We are doing 180 days challenge and going to complete the whole course within the duration with quality content on Youtube. I am on the mission to create a tech revolution in our country and in upcoming future we want to create a tech which will create many jobs in India.

Video will come on Mon-Fri at 6am in the morning

DSA Course for free
C++ Free Course
Rohit Negi DSA Course C++
Coder Army DSA Course c++
Function in C++
Pointers in C++.
Strings
Vector
Introduction to Recursion


connect to me on Instagram: https://rohit978.page.link/insta
Linkedin: https://rohit978.page.link/linkedin
Telegram: https://rohit978.page.link/telegram