Fill Successor Phone with airSlate SignNow

Fill successor phone

so before starting this video i'd love to thank relevel for sponsoring this entire video a hiring platform with no degree required no experience required mentoring sessions available feels like a dream isn't it what if i say all of this is for free well reliable by an academy is here to make your dream come true but job opportunities in front and back end and business development from india's top companies for freshers and people in the early career reliable is here to make the entire hiring process super simple and super quick all you have to do is to give the relevant test and based on your score interviews will be scheduled and you will be hard so what are you waiting for make sure you check out all the links in the description and apply for the relevant tests as soon as possible hey everyone welcome back to the channel i hope you guys are doing extremely well so today we will be solving the problem finding the in order successor in a binary search tree now what is the binary search tree if you are given a node then everything to the left of it is smaller than that node value so over here everything to the left of 5 is smaller than 5 and everything to the right of 5 is greater than 5 here smaller on left greater on right that is what is the definition of binary search tree if you want to know in much more depth you can check my entire playlist out now the question states you have to find the in-order successor in a binary search tree now you're given this value eight okay you're given this particular value eight and i've been asked hey listen give me the in order successor so if you write the in order if you write the in order of this particular binary search tree you will get that as one two three four five six seven eight nine ten by the way in order is left node and then right that is what the in order is so if you write it down this is what it is so where is eight eight is here so what is the in order successor so the in order successor is as of now this one yes that's the in order successor so i can say the inorder successor is nine i hope you have got the definition of inorder successor now you are required like you will be given a value and the binary search tree you have to give me the successor of this particular binary sorcery for a given value so how will you do this now the brute way is very simple and straightforward you can just store the in order and then you can find now you know one thing in binary search tree if you store the inorder the in order is actually sorted the in order of a...