Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightA linear list in which each node has pointers to point to the predeces...

A linear list in which each node has pointers to point to the predeces...

  • Q. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as
  • filter_dramaExplanation
    Answer is : C
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. To implement Sparse matrix dynamically, the following data structure is used
  • filter_dramaExplanation
    Answer is : D
    None.
  • 2. A circular linked list can be used for
  • filter_dramaExplanation
    Answer is : C
    None.
  • 3. What are implicit and explicit implementations of freelists?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 4. How do you calculate the pointer difference in a memory efficient double linked list?
  • filter_dramaExplanation
    Answer is : B
    None.
  • 5. How to travel a tree in linkedlist representation?
  • filter_dramaExplanation
    Answer is : D
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points