answersLogoWhite

0

An ordered list of data in any programming language is simply a sorted array or list. In C++ this can either mean a sorted array, vector, list or forward list.

User Avatar

Wiki User

11y ago

What else can I help you with?

Continue Learning about Engineering

Role of data structure to insert an element in the data structure?

using data structure an element can insert at any position easily. with out traversing through the entire list.


What is the difference between linked list and Ordinary list?

A list is an abstract data structure, usually defined as an ordered collection of data. A linked list refers to a specific implementation of a list in which each element in the list is connected (linked) to the next element.


Mini project on employee database using linked list on c language code?

mini project data structure


Can implement circular lists using stack?

No. A stack is a data structure that allows insertion and removal at the top. A circular list allows insertion and removal anywhere in the list. The two types of data structure are too different to be reasonably implementable in terms of each other.


How do you implement queue using stack in c plus plus?

A queue in any language is a singly-linked list structure that permits new data to be inserted only at the end of a list while existing data can only be extracted from the beginning of the list. Queues are also known as a first in, first out (FIFO) structure. Unlike a standard singly-linked list, the list maintains a pointer to the last node as well as the first, in order to insert new data and extract existing data in constant time. Variations on the queue include the priority queue which permit data to be weighted, such that data with the greatest priority is promoted to the front of the queue, behind any existing data with the same or higher priority, using an insertion sort technique. Insertion is therefore achieved in linear time rather than constant time, however extraction is always in constant time.

Related Questions

Role of data structure to insert an element in the data structure?

using data structure an element can insert at any position easily. with out traversing through the entire list.


What is the difference between linked list and Ordinary list?

A list is an abstract data structure, usually defined as an ordered collection of data. A linked list refers to a specific implementation of a list in which each element in the list is connected (linked) to the next element.


What are the advantages of using a Java sorted list data structure over other data structures for storing and managing data?

One advantage of using a Java sorted list data structure is that it maintains elements in a sorted order, making it easier and faster to search for specific items. This can be particularly useful when dealing with large amounts of data that need to be accessed in a specific order. Additionally, a sorted list can also facilitate efficient insertion and deletion operations, as the structure is already organized in a sorted manner.


Mini project on employee database using linked list on c language code?

mini project data structure


What is the difference between data structure and abstract data type?

An Abstract Data Type is an interface that interacts with a data structure. A Data Structure is an implementation of the ADT. for example. If you were going to create a linked list you would create an Interface listing all the methods required by the list. Then in the linked list class you would code how the list uses these methods. Hope this helps :)


Is a linked list is a data structure that contain data and a link to another data?

Yes.


Can implement circular lists using stack?

No. A stack is a data structure that allows insertion and removal at the top. A circular list allows insertion and removal anywhere in the list. The two types of data structure are too different to be reasonably implementable in terms of each other.


What is heterogeneous linked list?

Heterogeneous Linked List is a linked list data-structure that contains or is capable of storing data for different datatypes.void pointer is basically used in these types of linked list as we are not sure of which type of data needs to be stored


What is multiple link?

A (singly) linked list is a data structure of nodes where each node contains a value and a pointer to the next node.A doubly linked list is a data structure where each node has two pointers, one to the next and one to the previous node, so you can traverse the chain of links in both directions.A multiple linked list has several pointers in each node. They are used to traverse the nodes in different orders, for example one set of links ordered by date of birth and another ordered alphabetically by name.


What is an association list?

An association list is a data structure which associates keys with data, implemented as a list whose members are paired storage locations.


What is typically contain information that is similar to terms in a list?

A linked list data structure.


List advantages and disadvantages for data structure diagrams?

uqwyhvxuyhasbxiuqa