(i) A linked list is formed from the objects of the class: class Node{int num;Node next;


      (i) A linked list is formed from the objects of the class: 
    class Node
    {
    int num;
    Node next;
    }
    Write an Algorithm OR a Method to insert a node at the beginning of an existing
    linked list.
    The method declaration is as follows:
    void InsertNode( Nodes starPtr, int n )
    (ii) Answer the following questions from the diagram of a Binary Tree given below:               
    
    (a) Write the in-order traversal of the above tree structure. 
    (b) Name the children of the nodes B and G. 
    (c) State the root of the right sub tree.

Solution:

ALGORITHM Step 1:Start Step 2: Node newPtr=new Node() Step 3:newPtr.num=n Step 4: newPtr.next=NULL Step 5:If starPtr= NULL then go to step 7 Step 6: newPtr.next=starPtr Step 7: starPtr=newPtr Step 8: End OR Method: <pre class="" style="font-weight: 900; font-size: medium; font-family: 'Tillana', cursive;height: 15em;"> Class LinkedList { void InsertNode(Node starPtr , int n) { Node newPtr ; newPtr = new Node( n , NULL); if(starPtr = NULL) newPtr.next = starPtr ; starPtr =newPtr; } } </pre> </h5> <h5 class="text-dark"> (b) (i) D B A F E G H (ii) D is the child of B ; Eand Hare the children of G (iii) F </h5>

Solution:

Contact Us

REACH US

SERVICES

ADDRESS