Converting Binary Tree to Binary Search Tree without changing spatial structure

[@JamesStiling1985]

This is the best explanation and visualization that I have seen for BT to BST conversion. well done!

[@IDeserve]

Thanks James!

[@IDeserve]

Dear Friends, If you like our content and would like us to continue making great content for you, please spread the word about IDeserve. A share/appreciation from you on social network would mean the world to us! Also, do like our Facebook page: facebook.com/IDeserve.co.in :) Thanks, -Team IDeserve.

[@goodpeople7615]

Cannot hope for better explanation than this . It was smooth and clear 👌

[@Kriishna47]

A note, We can do any traversal not just IN.ORDER. After traversing, sort the array, and replace accordingly

[@emirhandemir3872]

Great and simple explanation! I liked the video!

[@IDeserve]

Thanks Emir!

[@DivyaPaliwal185]

Hi, I just wanted to know that id the data of binary tree is anyway given in an unsorted to form then why are we traversing it first and then sorting and traversing simultaneously. why don't we sort it in the beginning itself. Thanks, Divya

[@-GTALABATTULAHARSHITHA]

nice

[@charvakpatel962]

Just a little note When it comes to scalability, using array to store a traversal or any data related to tree which have space of order O( n ) is a bad idea. Why? Let's take my computer for example, it doesn't allow size of array more than 10^5, It will close in runtime. but a tree with 10^5 nodes is normal lets say a height balanced tree has height 30 than it will have 10^9 approx nodes So your code will crash for such inputs To solve this whenever you want to store something, use lInked lists which can store too much data A tiny modification on this code and it will support linked list A Request : You guys have covered how to make a balanced BST tree form Array in O( n ) time You guys should also cover how to make balanced BST directly from Linked List without using any array in O( n ) time

[@codeworld9920]

Can we use this method to convert min heap to BST?

[@alexsugarman9511]

Is there a way that we can balance this as well?

[@codercoder2286]

Good explanation

[@IDeserve]

Thanks Coder for your kind words :) We are striving hard to make understanding algorithms easier. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Online Code Submission, Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@IDeserve]

Hey, If you would like to request a new video, here is the process: kzbin.info/www/bejne/aZe0fYKcqrKZopI Thanks, -Team IDeserve.

[@falakk22]

awesome illlustration Thanks

[@IDeserve]

Thanks :D

[@rishihere5059]

Thank you sir

[@ajr1791ze]

cute solution.