Add One Row to Tree | Live Coding with Explanation | Leetcode - 623

[@AlgorithmsMadeEasy]

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!!
Questions you might like:
✅✅✅[ Tree Data Structure ] : th-cam.com/play/PLJtzaiEpVo2zx-rCqLMmcFEpZw1UpGWls.html
✅✅✅[ Graphs Data Structure ] : th-cam.com/play/PLJtzaiEpVo2xg89cZzZCHqX03a1Vb6w7C.html
✅✅✅[ February Leetcoding Challenge ] : th-cam.com/play/PLJtzaiEpVo2wrfvII0eZQsPm-MZCmHodm.html
✅✅✅[ January Leetcoding Challenge ] : th-cam.com/play/PLJtzaiEpVo2wCalBcRcNjXQ0C6ku3dRkn.html
✅✅✅[ December Leetcoding Challenge ] : th-cam.com/play/PLJtzaiEpVo2xo8OdPZxrpybGR8FmzZpCA.html
✅✅✅[ November Leetcoding Challenge ] : th-cam.com/play/PLJtzaiEpVo2yMYz5RPH6pfB0wNnwWsK7e.html
✅✅✅[ August Leetcoding Challenge ] : th-cam.com/play/PLJtzaiEpVo2xu4h0gYQzvOMboclK_pZMe.html
✅✅✅July Leetcoding challenges: th-cam.com/play/PLJtzaiEpVo2wrUwkvexbC-vbUqVIy7qC-.html
✅✅✅June Leetcoding challenges: th-cam.com/play/PLJtzaiEpVo2xIfpptnCvUtKrUcod2zAKG.html
✅✅✅May Leetcoding challenges: th-cam.com/play/PLJtzaiEpVo2wRmUCq96zsUwOVD6p66K9e.html
✅✅✅Cracking the Coding Interview - Unique String: th-cam.com/play/PLJtzaiEpVo2xXf4LZb3y_BopOnLC1L4mE.html
Struggling in a question??
Leave in a comment and we will make a video!!!🙂🙂🙂

[@ShubhamSharma-sf8wk]

Simplest explanation available on the internet.

[@AlgorithmsMadeEasy]

GlD you liked it !!

[@shreyansh3862]

amazing explanation...
I really like the animation

[@AlgorithmsMadeEasy]

Glad to hear that!

[@astronautatul]

Great Explanation ....:)

[@AlgorithmsMadeEasy]

Thanks!!!

[@mohammadyahya78]

Amazing explanation. Thank you.

[@abhisheksuryavanshi9675]

Great job!

[@AlgorithmsMadeEasy]

Thanks @abhishek 🙂

[@CRamPrasannaCV]

Understood :-)

[@ankurpurohit5091]

TreeNode* addOneRow(TreeNode* root, int val, int depth, int l = 1) {
if(depth == 1){
TreeNode* newroot = new TreeNode(val);
if(l)
newroot->left = root;
else
newroot->right = root;
return newroot;
}
if(root){
root->left = addOneRow(root->left, val, depth-1, 1);
root->right = addOneRow(root->right, val, depth-1, 0);
}
return root;
}