- Популярные видео
- Авто
- Видео-блоги
- ДТП, аварии
- Для маленьких
- Еда, напитки
- Животные
- Закон и право
- Знаменитости
- Игры
- Искусство
- Комедии
- Красота, мода
- Кулинария, рецепты
- Люди
- Мото
- Музыка
- Мультфильмы
- Наука, технологии
- Новости
- Образование
- Политика
- Праздники
- Приколы
- Природа
- Происшествия
- Путешествия
- Развлечения
- Ржач
- Семья
- Сериалы
- Спорт
- Стиль жизни
- ТВ передачи
- Танцы
- Технологии
- Товары
- Ужасы
- Фильмы
- Шоу-бизнес
- Юмор
Tree Construction from Traversals | Tree Construction from Traversals | Selection With Sathi
📚 Tree Construction from Traversals | Tree Construction from Traversals
Build trees from Inorder+Preorder, Inorder+Postorder, BST from Preorder & Serialization
📌 Key Formulas:
1. Build Tree from Inorder + Preorder: Preorder[0] = root | Find root in Inorder to split left & right subtrees
2. Build Tree from Inorder + Postorder: Postorder[-1] = root | Find root in Inorder to split subtrees
3. Build BST from Preorder Alone: BST property + preorder is enough — no inorder needed
4. Serialize & Deserialize Binary Tree: Preorder with null markers → unique string representation
⏱️ Timestamps:
0:00 Introduction
0:33 Build Tree from Inorder + Preorder
1:27 Build Tree from Inorder + Postorder
2:13 Build BST from Preorder Alone
3:05 Serialize & Deserialize Binary Tree
3:56 Construct from Inorder + Preorder
4:46 Construct from Inorder + Postorder
5:37 Build BST from Preorder [8,5,1,7,10,12]
6:40 Serialize & Deserialize Binary Tree
7:30 Quick Tips & Tricks | टिप्स
8:23 Summary | सारांश
💡 Quick Tips:
• GATE classic: given preorder + inorder, unique tree can be built. Preorder + postorder alone is NOT unique for general BT
• For BST: preorder alone is sufficient because inorder = sorted(preorder). Use bounds method for O(n)
• Inorder + Preorder: root is preorder[0]. Inorder + Postorder: root is postorder[-1]. Build order differs!
• Serialize with null markers (#) to make preorder unique — this is the standard codec for LeetCode and interviews
📚 Useful for: GATE CSE, Placements, Coding Interviews and all govt exams
━━━━━━━━━━━━━━━━━━━━━━━━━━━━
📱 Download App: https://play.google.com/store/apps/details?id=com.selectionwithsathi.app
🌐 Website: https://selectionsathi.com
🔔 Subscribe: https://www.youtube.com/@SelectionWithSathi
#SelectionWithSathi #TreeConstructionfromTraversals #GovtExam #SSC #Railway #सरकारीपरीक्षा
Видео Tree Construction from Traversals | Tree Construction from Traversals | Selection With Sathi канала Selection With Sathi
Build trees from Inorder+Preorder, Inorder+Postorder, BST from Preorder & Serialization
📌 Key Formulas:
1. Build Tree from Inorder + Preorder: Preorder[0] = root | Find root in Inorder to split left & right subtrees
2. Build Tree from Inorder + Postorder: Postorder[-1] = root | Find root in Inorder to split subtrees
3. Build BST from Preorder Alone: BST property + preorder is enough — no inorder needed
4. Serialize & Deserialize Binary Tree: Preorder with null markers → unique string representation
⏱️ Timestamps:
0:00 Introduction
0:33 Build Tree from Inorder + Preorder
1:27 Build Tree from Inorder + Postorder
2:13 Build BST from Preorder Alone
3:05 Serialize & Deserialize Binary Tree
3:56 Construct from Inorder + Preorder
4:46 Construct from Inorder + Postorder
5:37 Build BST from Preorder [8,5,1,7,10,12]
6:40 Serialize & Deserialize Binary Tree
7:30 Quick Tips & Tricks | टिप्स
8:23 Summary | सारांश
💡 Quick Tips:
• GATE classic: given preorder + inorder, unique tree can be built. Preorder + postorder alone is NOT unique for general BT
• For BST: preorder alone is sufficient because inorder = sorted(preorder). Use bounds method for O(n)
• Inorder + Preorder: root is preorder[0]. Inorder + Postorder: root is postorder[-1]. Build order differs!
• Serialize with null markers (#) to make preorder unique — this is the standard codec for LeetCode and interviews
📚 Useful for: GATE CSE, Placements, Coding Interviews and all govt exams
━━━━━━━━━━━━━━━━━━━━━━━━━━━━
📱 Download App: https://play.google.com/store/apps/details?id=com.selectionwithsathi.app
🌐 Website: https://selectionsathi.com
🔔 Subscribe: https://www.youtube.com/@SelectionWithSathi
#SelectionWithSathi #TreeConstructionfromTraversals #GovtExam #SSC #Railway #सरकारीपरीक्षा
Видео Tree Construction from Traversals | Tree Construction from Traversals | Selection With Sathi канала Selection With Sathi
Build BST from Preorder Alone Build Tree from Inorder + Post Build Tree from Inorder + Preo Coding Interviews GATE CSE Placements RRB NTPC Railway SSC SSC CGL SSC GD Selection With साथी Serialize & Deserialize Binary Tree Construction from Travers concept tutorial free education govt exam sarkari exam सरकारी नौकरी सामान्य ज्ञान
Комментарии отсутствуют
Информация о видео
12 мая 2026 г. 17:47:59
00:11:11
Другие видео канала
Polity | Selection With Sathi #Shorts
Boat Stream | Selection Sathi #Shorts
Collocations — शब्दों की प्राकृतिक जोड़ियाँ | Collocations — Natural Word Pairs
Railway | Selection With Sathi #Shorts
रोशनी के 5 Amazing Facts! | Light Facts in Hindi #Shorts
CA Science - 2026-05-19 | Exam Trick #Shorts
All 12 Tenses in 45s! | English Trick #Shorts
Boundary Lines! | GK Trick #Shorts
Syllogism Venn Trick! | Reasoning Trick #Shorts
Quiz Ratio | Selection With Sathi #Shorts
सादृश्यता — शब्द, संख्या और अक्षर सम्बन्ध | Analogy — Word, Number & Letter Relationships
Chem Water | Selection Sathi #Shorts
CA Politics - 2026-05-14 | Exam Trick #Shorts
Selenium Basics | Selenium Basics | Selection With Sathi
Economy Gst | Selection Sathi #Shorts
Time Distance | Selection Sathi #Shorts
CA Science - 2026-05-13 | Exam Trick #Shorts
CA Default - 2026-05-13 | Exam Trick #Shorts
CA Politics - 2026-05-19 | Exam Trick #Shorts
CA Politics - 2026-05-15 | Exam Trick #Shorts
Time Work | Selection With Sathi #Shorts
