Binary tree traversal - breadth-first and depth-first strategies

preview_player
Показать описание
See complete series on data structures here:

In this lesson, we have discussed algorithms for binary tree traversal. We have talked about breadth-first and depth-first strategies for tree traversal like level-order, preorder, inorder and postorder.

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

Dude, you're like one of the few people I'd comment on.. your work is amazing. You've brought insane amount of clarity to each concept.

ahrik-
Автор

The level of clarity in concepts i gain after your watching videos is PHENOMENAL!
Keep up the good work.
Open up some portal where willing people like me can give some money to your efforts.

MhZnSO
Автор

Thank you very much for your explanation on DFS! Understanding about DLR, LDR, LRD really just makes everything 100x simpler.

yosuanicolaus
Автор

These videos are way clearer than my engineering school's courses
THANK YOU SO MUCH MAN YOU'RE THE BEST

cripplingdepression
Автор

You have got unusual clarity and insight into the concepts you teach. People like you are a breath of fresh air in CS. Thank you for deciding and taking time to do these series!

ribaker
Автор

Excellent lesson. Related Leetcode exercises:
144 - Binary Tree Preorder Traversal
102 - Binary Tree Level Order Traversal

dhillaz
Автор

There are people who teach, because they hold a degree, and that degree allows them to do what ever they want. And there are people who have actually the skill of teaching a special subject. Few Universities in the US have skilled teachers...
Thank you so much for sharing your expertise with the world!

altechy
Автор

Thanks for the upload! The coloring of nodes during traversal really helped with my comprehesion

nickorefice
Автор

best set of tutorials I've came across. outstanding!

joeybing
Автор

Your preorder inorder postorder explanation is fantastic that cleared my intrinsic confusion.

lakshminarasimhanb
Автор

Can someone please explain why Inorder traversal of a binary search tree gives a sorted list? at 11:27 the list has the order G H I. now I is definitely greater than G. but both G and H are smaller than I, so how come G is before H necessarily? It could be reverse also?

kartikxramesh
Автор

One of the best explanations I have ever seen on Youtube.

pranavshukla
Автор

Please i recommend everybody to see all his lectures. THey are better than any college teacher :o THANK YOU So MUCH

mashable
Автор

I am watching your video's from couple of days and i haven't watched anything better than this. You are really helping people to understand real concepts. No noise. Gr8!. Please continue and help people.

NeeliMegha
Автор

thank you. easy to follow and great visuals. 10 years on and this is still great.

addadd
Автор

Hahaha, I have never seen an explanation so clear, step-by-step. There is no space for doubts in between. It's a piece of "for dummies" mastery. Thanks

camillesatoshi
Автор

The best explanation across the internet

snigdhasingh
Автор

who the heck dislikes this videos... these are the best..

rbsupercool
Автор

Agree its difficult to manage still you can do a live stream to chat with your share feelings with us....that would be great

aryanverma
Автор

You are the best professor ever! Thank you so much for posting videos

MariR