Doubly linked list Insertion at given position Python

PROGRAM TO INSERT A NODE TO A DOUBLY LINKED LIST AFTER A GIVEN NODE



def insertAfter(self, prev_node, new_data):
 
        # 1. check if the given prev_node is NULL
        if prev_node is None:
            print("This node doesn't exist in DLL")
            return
 
        #2. allocate node  & 3. put in the data
        new_node = Node(data = new_data)
 
        # 4. Make next of new node as next of prev_node
        new_node.next = prev_node.next
 
        # 5. Make the next of prev_node as new_node
        prev_node.next = new_node
 
        # 6. Make prev_node as previous of new_node
        new_node.prev = prev_node
 
        # 7. Change previous of new_node's next node */
        if new_node.next is not None:
            new_node.next.prev = new_node


Comments

Post a Comment

Popular posts from this blog

Find first non-repeating character Python

PROGRAM TO FIND FIRST NON-REPEATING CHARACTER IN A STRING IN ONE TRAVERSAL NO_OF_CHARS = 256     # Returns an array of size 256 containg count # of characters in the passed char array def getCharCountArray(string):      count = [ 0 ] * NO_OF_CHARS      for i in string:          count[ ord (i)] + = 1      return count     # The function returns index of first non-repeating # character in a string. If all characters are repeating # then returns -1 def firstNonRepeating(string):      count = getCharCountArray(string)      index = - 1      k = 0          for i in string:          if count[ ord (i)] = = 1 :              index = k       ...
Read more

Find Duplicates Java

PROGRAM TO FIND REPEATING NUMBERS IN AN ARRAY class MAIN {           public static void main(String args[]) {          int numRay[] = { 0 , 4 , 3 , 2 , 7 , 8 , 2 , 3 , 1 };               for ( int i = 0 ; i < numRay.length; i++) {              numRay[numRay[i] %  numRay.length] = numRay[numRay[i] %  numRay.length] + numRay.length;          }          System.out.println( "The repeating elements are : " );          for ( int i = 0 ; i < numRay.length; i++) {              if (numRay[i] >= numRay.length* 2 ) {                ...
Read more

Special Keyboard Java

PROGRAM TO PRINT MAXIMUM NUMBER OF A'S USING GIVEN FOUR KEYS import java.io.*;   class GFG {        // A recursive function that returns      // the optimal length string  for N keystrokes      static int findoptimal( int N)      {          // The optimal string length is N          // when N is smaller than 7          if (N <= 6 )              return N;            // Initialize result          int max = 0 ;            // TRY ALL POSSIBLE BREAK-POINTS          // For any keystroke N, we need to        ...
Read more