Sorting Algorithms++ Ep03: Tree Sort

preview_player
Показать описание
Making use of Binary Search trees as defined last lesson, we attempt to sort data using a nifty technique called In-Order Traversal.

= Intro Track Adapted From =
Licensed under Creative Commons: By Attribution 3.0
ISRC: USUAN1100879

= 0612 TV =
0612 TV is your one stop for general geekery! Learn about a variety of technology-related subjects, including Photography, General Computing, Audio/Video Production and Image Manipulation! Enjoy your stay, and don't hesitate to drop me a comment or a personal message to my inbox =) If you like my work, don't forget to subscribe!

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

You are the first one explaining where it exactly goes back when it reaches leaf node, I was confused with 'go back status' before! Thanks!

ruiwenzhang
Автор

Great vid dude. Going to start the full series.

h.cazador
Автор

If we allow extra space it is quite easy to write tree sort for linked lists
For arrays it is better to use heap sort instead of tree sort

holyshit
Автор

Thank you for doing this, it is really helpfull :D

LeonOmelan
Автор

did not explain how to sort a list through tree sort

Alay