Pre-order traversal of Binary Tree | Step by step demo with example | Study Algorithms

preview_player
Показать описание
Each node of a tree is a mini-tree in itself. It has a left child and a right child. Based on this idea, we can have some permutations by which we can access these values. In a pre-order traversal you first look at the root value, then the left child and then the right child. This video focuses only on the pre-order binary tree traversal with a live step by step demo. You will also see a dry-run of the code to understand how it actually works. Code sample provided in JAVA.

Chapters:
00:00 - Intro
01:00 - Concept of pre-order traversal
02:37 - Demo for pre-order traversal binary tree
06:35 - Dry-run of code pre-order traversal
09:04 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#binarytrees #programming #datastructures
Рекомендации по теме
Комментарии
Автор

Very good explanation. This video deserves more views . It helps a lot Thanks!

leonelmessi
Автор

How should one understand the working of recursive functions written here ?

kairavikalra
join shbcf.ru