![]() ![]() Note that the algorithm follows the Cormen book. x must have space for 1 extra key as we have been splitting all nodes in advance. When we split y, we move a key from y to its parent x.ģ) The loop in step 2 stops when x is leaf. If k is smaller than mid key in y, then set x as the first part of y. c) If y is full, split it and change x to point to one of the two parts of y. b) If y is not full, change x to point to y. a) Find the child of x that is going to be traversed next. ISRO CS Syllabus for Scientist/Engineer Exam.ISRO CS Original Papers and Official Keys.GATE CS Original Papers and Official Keys.Full Stack Development with React & Node JS(Live).Java Programming - Beginner to Advanced. ![]() ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |