Inorder Successor in a binary search tree 

This entire playlist is a treasure. Downloaded all the videos and created multiple copies in my PC, my external hard drive and google drive. Cannot risk it losing in case of apocalypse. And whoever you are, a big thank you. You are a GOAT.

It’s been 10 YEARS since this playlist and people are still watching it, I don’t usually comment but Really Thank you for this masterpiece

After 2 Years...THis videos Helped the same.....i am sure till many years this videos will keep helping Students

finally i find someone who explain all things with details thank you so much

I am a beginner in DS. These videos helped me a lot to understand quickly. Thanks a lot. Please don't stop uploading. Keep going.

Hi Sir, I have followed all your BST tutorials. It was very great and clear explanation. Initially I was afraid of learning BST. Now I can say I have learned BST confidently from your explanation. Thank you very much your contribution to helping programmers.

mycodeschool Your tutorials are BRILLIANT! Please do continue the series as soon as possible. Would like to see more on Trees, Graphs, Maps, Hash-tables etc.

Yooo, this whole concept of BST is freaking amazing, almost magical. Thanks a lot for sharing this mate!

finally completed the whole DS series :)

I'm watching this series after my engineering, these data structures make much more sense now thank you so much

Hi I'm Kapil, These codes for successor and predecessor seem to work fine. They keep on storing the pointer to nodes whose value is greater than (or less than) the given integer in the path of search for the integer and the latest updated value is our answer. And also when it finds the integer, it doesn't stop, it goes on to find the next greater value (or smaller) by traversing further down the tree. It's a tiny code :) TreeNode* getSuccessor(TreeNode* A, int B) { TreeNode *P=NULL; while(A!=NULL) { if(A->valright; } else if(A->val>B) { P=A; A=A->left; } } return P; TreeNode* getPredecessor(TreeNode* A, int B) { TreeNode *P=NULL; while(A!=NULL) { if(A->valright; } else if(A->val>=B) { A=A->left; } } return P;

I'm in tear watching your video sir, the way you spreading knowledge is on god tier, I coundn't been more satisfied with my life without learning from you.Much Love!

this play list is absolute bonus for every programmer who wants to get good at data structure , Many thanks to CS DOJO for suggesting this !!!!!

All videos are great,most important thing is that they are all very interactive and you have worked very hard in making them and teaching us. Thankyou

In Getsuccessor function instead of: "if(current->data < ancestor->data)" we must use :if(current->data data)" To ensure the data less or equal will be found in left subtree. Thanks for sharing your knowledge.

Completed all the 13 Videos on BST I feel like a BST Master and able to complete most Leetcode problems on BST:)

I'm gonna hit Like 👍🏻to every video of this channel coz It Deserves !!

This is THE PERFECT explanation of this concept.

You haven't handled the case when current node is leaf node. Yet, still it is an excellent tutorial for DS and I will recommend this to other. I have learnt a lot from you. Thank you so much..

Really, great stuff man. You have helped a lot of people. You should be really proud of yourself.

Man...U are an inspiration for me.. You are just great.. No words can express your work.. Thanx for helping

getSucessor in case II is really insightful and elegant. That sums up this video.

Your videos are "the" best Any plan to cover self balancing trees like Red Black or AVL trees

Impressive. Thanks a million times. You are simply the best.

Kudos for your efforts in making concepts seem this easy ! Love your channel. Really helpful !!

can you make videos on red black trees, greedy algo, kruskal algo and other topics that are in cormen. i went through mit videos i must say you are better than those fancy professors

Most enjoyable experience i ever had of online learning, so much love and respect.

Bro u are the best . cleared all doubts

If it is the max element in the BST, it should return null. The video doesn't take this corner case into consideration. Anyway, another really fantastic video. I learned a lot from the whole series. Thank you.

brother make an updated playlist of ds-algo with same explanation . i have not words to express who you are

if the right subtree is present, the successor will be the node with the minimum value in right subtree else successor will be the node where we took the last left turn while searching for the current node.

your videos are the best i can find. I love u

Thanks for the video series. They've been really helpful for me these days. Can you please do a series on Balanced Binary trees and Tries as well. Thanks in advance.

Thank you very much...step by step I like that!! Bravoooo!!! wish you could make more videos on computer science

Dude, you just I locked my brain on this. Thank you so much!

@mycodeschool, thanks for the video!, but I believe you should create the video for the predeccessor, in the end people use this videos to learn, but also as reference... dont treat us bad :(

theNewBoston of Indian software youtubers!

Keep it up dude! you deserves appericiation

Sir,I am a big fan of this channel.Please upload videos of some more topics of Data Structures.

Woh, you did a problem on iterative inorder traversal without stack!

this is really really helpful. THANK YOU

Thank You Sir

Very helpful!

Hey, great video thanks a lot. I was wondering a few things about the code you wrote: Is it better in C++ to use nullptr instead of the C macro NULL ? Is temp a good variable name? Coud we call the variable "successor" to make clear we're returning the successor? Is this: while(temp->left != NULL_ temp=temp->left; equivalent to: while (temp = temp->left) { ; //do nothing } Which one is a better c++ idiom?

Thank you is all I can say!

Good analysis!

i really enjoyed while watching each and every videos. can you add some videos of threaded binary tree if possible.............

Thank u so much i finally understood this successor thing

i dont know if its good practice, but it a different faster implementation in trade off for higher memory requierements Node* successor(Node * root, int data, Node * ancestor=NULL){ //if found, return either right sub or ancestor if(root->data==data){ if(root->right!=NULL)return root->right; else return ancestor; } // search for Node, if call for left sub, give self as arg if (datadata)return successor(root->left, data, root); else return successor(root->right, data, ancestor); }

Plss make more videos on graphs

Java code for inorder predecessor-> public Node inOrderPredecessor(Node root,int key){ Node current=search(root,key); if(current==null)return null; if(current.left!=null){ return max(current.left); }else{ Node ancestor=root; Node predecessor=null; while(ancestor!=current){ if(key>ancestor.data){ predecessor=ancestor; ancestor=ancestor.right; }else if(key

you have a very good English!

Finally completed !!!

Thanks sir.....

very good explanation

Hats off.Its a treasure

dude, a single optimization to propose, why not maintain the successor while you find the node? if right subtree doesnt exists,we simply return that value.. this way we sorta save the second traversal in else conditon. ideally it would be o(h) + o(h) but when we maintain it, it would turn out to be only o(h) single go. Find could be modified as :- > Node* Find(Node* root,Node* succ, int data){ Node* ancestor = root; while(ancestor->data != data){ if(data < ancestor->data){ succ = ancestor; ancestor = ancestor->left; } else{ ancestor=ancestor->right; } } return ancestor; } so , as soon as else is triggered, we directly return the succ node that we maitained during FInd().

Inorder presecessor code in c : enjoy guys :) struct node* Getpresecessor( struct Node* root , int data ) { // Search the Node - O(h) struct node* current = Find(root,data); if(current == NULL) return NULL; if(current->left != NULL) { //Case 1: Node has right subtree return maxValueNode(current->left); // O(h) } else { //Case 2: No right subtree - O(h) struct node* presecessor = NULL; struct node* ancestor = root; while( ancestor != current ) { if( current -> key > ancestor -> key ) { presecessor = ancestor; // so far this is the deepest node for which current node is in left ancestor = ancestor->right; } else ancestor = ancestor->left; } return presecessor; } } struct node * maxValueNode(struct node* node) { struct node* current = node; /* loop down to find the leftmost leaf */ while (current->right != NULL) current = current->right; return current; }

thank you sir it very much cleared way

FOR PREDECESSOR : - CASE 1 : we will have to find max in left subtree of the given node CASE 2: and when left subtree is not available curr = node_given ; ancs = root ; pred = NULL while ( ancs != NULL ) { if( ancs->data < curr->data ) { pred = ans; ancs = ancs->right; } else ancs = ancs->left; } return ancs;

thank u bro

in the else part inside while loop ,we need a "sucessor=ancestor" there too i think (right subtree part)

I noticed it's been a while since you uploaded any data structure videos. Will there be more, or is this the end of the line? Also, if you do continue the series, it would be cool to see a hashmap/hashtable implementation.

sir,please made video on combinations of sum

Excellent! Thank you.

great work

bro, please come back!

pls talk about n-ary tree

Thanks

while(ancestor != current) will not work to find inorder successor of a element in right subtree. So if we change it to while(ancestor != null) i think it will work.

***** you said that you will be making more lessons on problems on Binary Trees and Binary trees in this video. Why did you stop ?

Very Good!

Can you add one more lecture on avl tree before graph.. That is the thing which is missing in your lectures

sir , in this we don't have condition to check if the element is largest ,then there will be no successor.Can we use a find max function to check if it is the largest element ? will it affect the time complexity ??

Great video. But it would have been much clearer if in case2 code, ancestor was named as temp and successor was named as ancestor.

what about 11, what case does it fall into

why there are ont avl tree?

u are bossssssss

Hi! Your code had an error when I compiled it. The error is in the last line return successor; and says that successor undeclared (first use in this function). I delcared struct node * successor = NULL; at the top but then it doesn't return anything cause its Value is NULL and the value never changes inside the else statement! How can I fix it?

I guess that successor=ancestor, you have to define outside the if block. Am I correct please reply someone.

excellent

I like this.

Can't you traverse (right root and then left) and check if the next node you are going to traverse is the one you are looking the successor for?

AVL tree please

Plz tell me sir whats ur name?? Really amazing video

did he cover AVL trees?

what about AVL and B+ trees

what is the successor of 27 or 25 in this case?

share one tut on threaded binary tree if possible ;)

11:072 Excuse me!!!😂😂

GOAT

Deserving ❤️❤️

how does it come back from 6 to 8?

How to find post order by given data in- order d b e a f c g and pre order a b d e c f g

great

This good initiative had a bad end.

your all videos are awesome. why did you stop uploading videos bro ?

Good tutorial, but in your else statement you missed succesor = ancestor;

things r getting real tough...

love u