Merge Countersign Link with airSlate SignNow

Merge mark order

hello today we are going to see how to work to order English - father you started limping - let's see here these are the two sorted linked list and we are going to merge this engine to find this sorted English so you can see the day is ten fifty seventy nine hundred and twenty thirty forty sixty eighty and they merged to one this is it 10 20 30 40 50 60 70 80 90 and obviously the our answer is a sorted linked list so long let's keep talking to this so well P is pointing to the head of the first linkage and if you point into the mid of the second digit and there is one more pointer the name of the pointer is s and which is we can be called as a sorting pointer so the point s will initially find to the rule which has lesser value so here P is pointing to tell rescue is pointing to 20 so obviously take less than 20 this is nice it will easily point to till in the first interest if Q of 1 less than T then it will have pointed to see but now and he lets you edit pointing to the first you in the first English knowledge goes the next step is P will always point to the next node of s so feed right into the next mu of s and here's the comparison begins so we have to compare P with Q and whatever replaced it will point to that number and our newly liquid form so CP is crispy ultimately what is less 20 lesson so now L will point to 20 and this link will be deleted and this entry point is 20 and this is where H is 20 to 20 no no master no means the pointer to the point to the next node of H always see the point is P and Q after one comparison remember early is created the P and Q are set to the next node of Earth respectively now see now let's turn test pa-choo I mean so what if Lester 30 length so this is an originally there is no need to possibly well just for understanding I am making quick links in the regular so that we can break the result reductions in this afternoon so as this is lesson 2 H 3.0 now and so we will point to the next moon of H check P and you compare to see it for the each letter so again at 3 point here this means we becomes it because it is a part of million trees not the politicking the merge sorted so edges here right below me to my point here the next role of it he is comparing you yet 50 Glazer so how this links with point 250 and SV voyage to this one now Eddie's back in the first linkage so handful to use py to the next moon of L see these always fit in this link it is you with all this little distance so let's go now on it 70 and 60 watt incessant sixties later so again s this integrated as we point to distinctly and so this link we point to things so ed is carrying the cartilagenous in the end now as for the QB point to the next week clip so now it's on the 70d a 70 later so as we point is awaiting this link will now go to this link needed to the moon and as soon be we point to the next node of s compare 90 be yet aid is smaller so again this link beauty table and if we 4018 of and test which is pointing to a team of because eight years later now and for the rule Q will point to the next node of s yes now Q point if one of the occupational then here and q1 incident we have to directly connect this link of s to P this is the base condition in P was pointing to us then we would have directed the link object to Q but in this case and unit point into the we are selecting the link of s to P and this link list goes till the a allele me varies as read so we can figure out the forgetting it so we went into this one which is not happiness custom so yes the Jets 10 20 30 40 50 60 70 80 90 hundred and then so this is how we have merged two already holidays ladies let's say the program now so this is the code and we are going to execute this code on this example so here the name of the function is merge and parameters passed are the heads of two linkage that is P and Q so it is passed here P Q and the head of new linked list that is sorting this this is the tracing node of the link new linkage let's go inside so loadstar new head equal to null so the new head of the sorted linked list is declared this is the head of the more it sorted linked list let's go into the code if P equal to equal to null return Q so here if out of the two linked list if P is empty means if this linked list is not there in P is null then obviously our answer is Q if P is none and if Q is null then if Q is null then P is our answer as it is so here suppose if Q is not present so this linked list is not present in Q points to null then the merged sorted linked list will be only P so this was for example now let's go ahead with the code if P and Q if both are present if P is also present and Q is also present then what to do so as I have told you initially the pointer sorting that is we had called it as the point of s this is the sorting pointer this will point to the node which has lesser value so let's check it if P points data is less than or equal to Q points data then sorting will point to that node because this data is less sorting will point to that node else sorting we point to Q so this is what is followed here in this case 10 is less than 20 so s will point to 10 the first node of the first link weight and obviously that is our new head so 10 is our head of the answer linked list so our answer which starts from 10 and we will go ahead so the next condition here is the loop to trace through the motor through the two linkage so if P points data is less than or equal to Q point data so here and you must remember in this if condition after sorting points to P T points to the next node of sorting so P goes here much the next node of the sorting variable and then we go to this while loop so if that data is data is less than Q is greater so here if 50 is less than 20 which is not the case here so we come in L so in else sorting points next equal to Q so the next point of sorting so s is sorting pointer will point to Q so here will point to Q and sorting will point to Q now so sorting pointer will go to 2.2 20 years now Q is equal to sorting points next yes as the salting pointer is pointer is in this linked list queue will point to the next pointer of sorting and again we will go to the next iteration of this one loop and again P and Q will be compared at the end when Q reaches null at first then as you must remember in our last example when means this was the same example there when Q H null he was pointing here so I am at that case see here this is the condition if q equal to equal to none before that there is a condition if P equal to equal to that but that is not the case here so if Q equal to equal to null sorting points next equal to C so if sorting is pointing here then the next will point to the and the next link with me khadeem so and at the end we will return the new head point of the answer the new head is is still so this is how this code works and you can find out the whole code on my github link that is github.com slash Vivekananda that is my name we've a canal called echo you can find out the whole code on this link and you can use that code for your work hey friends please subscribe to my channel as a post algorithm videos every day and if you want a video on any particular topic then please mention in the comment below thank you