(Please watch LCA, before watching this video)
LCA:
• Lowest Common Ancestor of a Binary Tree | ...
Problem Name:
2196. Create Binary Tree From Descriptions
Problem Statement:
You are given the root of a binary tree with n nodes. Each node is uniquely assigned a value from 1 to n. You are also given an integer startValue representing the value of the start node s, and a different integer destValue representing the value of the destination node t.
Find the shortest path starting from node s and ending at node t. Generate step-by-step directions of such path as a string consisting of only the uppercase letters 'L', 'R', and 'U'. Each letter indicates a specific direction:
'L' means to go from a node to its left child node.
'R' means to go from a node to its right child node.
'U' means to go from a node to its parent node.
Return the step-by-step directions of the shortest path from node s to node t.
Problem Link:
https://leetcode.com/problems/step-by...
Graph Playlist:
• Graph Data Structure Series
Java Plus DSA Placement Course Playlist:
• Playlist
Java Plus DSA Sheet:
https://docs.google.com/spreadsheets/...
Notes:
https://github.com/Tiwarishashwat/Jav...
Telegram Link:
https://shashwattiwari.page.link/tele...
Ultimate Recursion Series Playlist:
• Playlist
Instagram Handle: (@shashwat_tiwari_st)
https://shashwattiwari.page.link/shas...
Samsung Interview Experience:
• I cracked Samsung | SRIB Interview Experie...
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
#ShashwatTiwari #coding #problemsolving