Boundary Traversal of Binary Tree | EPIC Tree Series | DSA | Shashwat Tiwari Hindi

Problem Name:
Boundary Traversal

Problem Statement:
Given a Binary Tree, find its Boundary Traversal. The traversal should be in the following order:

Left boundary nodes: defined as the path from the root to the left-most node ie- the leaf node you could reach when you always travel preferring the left subtree over the right subtree.
Leaf nodes: All the leaf nodes except for the ones that are part of left or right boundary.
Reverse right boundary nodes: defined as the path from the right-most node to the root. The right-most node is the leaf node you could reach when you always travel preferring the right subtree over the left subtree. Exclude the root from this as it was already included in the traversal of left boundary nodes.
Note: If the root doesn't have a left subtree or right subtree, then the root itself is the left or right boundary.

Problem link:

Java Plus DSA Placement Course Playlist:

Java Plus DSA Sheet:

Notes:

Telegram Link:

Ultimate Recursion Series Playlist:

Samsung Interview Experience:

Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung

Timestamp:
0:00 - Introduction

#ShashwatTiwari #coding​​ #problemsolving​

[sopnakesavan]

best explanation than striver, bhai keep posting more videos pls.

[vikasmandloi]

your explanation is great sir
hum aapki playlist follow kr rahe he

[mr.nishantawasthi]

Osm explain sir...
But upload daily videos please sir 🙏🙏

[adityamazumdar]

bhaiya code aapne github pe nhi dala kya?