answersLogoWhite

0

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

User Avatar

Wiki User

15y ago

What else can I help you with?

Related Questions

Time taken to insert an element after an element pointed by some pointer in data structure?

O(n)


Every data structure in data warehouse contains time element?

Every data structure in the data warehouse contains the time element. Why?


What is the time complexity of removing an element from a heap data structure?

The time complexity of removing an element from a heap data structure is O(log n), where n is the number of elements in the heap.


What is first in first out data structure?

QUEUE is the first in first out (FIFO) data structure. It is a linear data structure in which insertion of an element is done from rear end of a list and deletion of an element is done from front end of a list. For example- people in queue waiting for bus.


Assuming an emty list what operations are used to delete and insert a data?

Delete is not possible for an empty list, insert is something like this: Create a new list-element. Register it as the first element of the list. Register it as the last element of the list.


What is traversing in data-structure?

visit each element in a list at least onces.


Insert an element after an element in an array?

To begin, obtain the element to be added, such as x Then, say pos, get the position where this element will be put. Then shift the array items one position ahead, then do the same for all the other elements next to pos. Because the location pos is now empty, insert the element x there. To learn more about data science please visit- Learnbay.co


What is the difference between data and data element?

Data refers to raw facts and figures, while a data element is a unique unit of data that represents a specific attribute or characteristic. Data elements are used as building blocks to organize and structure data within a database or system.


What is the role of data structure in compiler design?

The role of the data structure in compiler designer is to take an input of a program written in another language and produce an output in another language. It also performs error detection.


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 is hierarchical structure in dbms?

In hierarchical database structure, data elements are linked together as an inverted tree structure. there's a root data element, below the root ,there are subordinate elements, each of which has its own subordinate elements and so on. It can have multiple levels. Data elements have parent-child relationship. A parent data element can have more than one subordinate elements, but a child can be connected with only one parent. Its limitation is it cannot provide flexibility in data access. because every data element can be accessed through a definite path from the root data element. All the relationships between data elements should map properly when tree structure is first designed.this database model is used in several database applications because data elements of several applications can be organized as a hierarchical tree structure.


Is array structure union is a collection of homogeneous type of data element?

They is three different things.