623. Add One Row to Tree | leetcode daily challenge | DSA | Hindi | shashwat

Problem Name:
623. Add One Row to Tree
Problem Statement:
Given the root of a binary tree and two integers val and depth, add a row of nodes with value val at the given depth depth.
Note that the root node is at depth 1.
The adding rule is:
Given the integer depth, for each not null tree node cur at the depth depth - 1, create two tree nodes with value val as cur's left subtree root and right subtree root.
cur's original left subtree should be the left subtree of the new left subtree root.
cur's original right subtree should be the right subtree of the new right subtree root.
If depth == 1 that means there is no depth depth - 1 at all, then create a tree node with value val as the new root of the whole original tree, and the original tree is the new root's left subtree.
Problem link:
leetcode.com/problems/add-one...
Java Plus DSA Placement Course Playlist:
• Java and DSA Course Pl...
Java Plus DSA Sheet:
docs.google.com/spreadsheets/...
Notes:
github.com/Tiwarishashwat/Jav...
Telegram Link:
shashwattiwari.page.link/tele...
Ultimate Recursion Series Playlist:
• Recursion and Backtrac...
Instagram Handle: (@shashwat_tiwari_st)
shashwattiwari.page.link/shas...
Samsung Interview Experience:
• I cracked Samsung | SR...
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
#ShashwatTiwari #coding​​ #problemsolving​

[@evigamer1136]

Awesome explanation

[@yogeshchauhan9401]

Very clear explanation 🎉

[@ankitpatel0101]

Balloon 🎈🎈🎈 2:39

[@mr.nishantawasthi4402]

Sir please upload more lecture for BST

[@dibbodas4116]

bhaiya apke liye sab ques easy hea

[@pulkitjain8135]

Na ye wala sahi me easy tha, ll ka question h

[@PiyushSharma-we8yd]

thankyou bhaiya for the video, bhaiya ye btaeye bst ke aur kitne problems tree series me add krenge?