recategorized by
4,363 views
2 votes
2 votes

The address field of linked list : 

  1. Contain address of next node 
  2. May contain null character
  3. Contain address of next pointer
  4. Both $\left (A \right)$ and $\left ( B \right)$
recategorized by

1 Answer

3 votes
3 votes

Option D

if node of linked list is not last node that  address field of linked list  Contain address of next node

if node of linked list is last  node that address field of linked list  May contain null character in case of singly linked list

Difference between a Static Queue and a Singly Linked List ...

 

Answer:

Related questions

2 votes
2 votes
2 answers
1
admin asked Mar 31, 2020
939 views
In binary search tree which traversal is used for getting ascending order values ?InorderPreorderPostorderNone of the options
2 votes
2 votes
2 answers
2
admin asked Mar 31, 2020
2,958 views
In a full binary tree number of nodes is $63$ then the height of the tree is :$2$$4$$3$$6$
2 votes
2 votes
4 answers
4