Computer Science, asked by Turgut, 10 months ago

Explain the operations on non primitive data structure

Answers

Answered by minhaj66340

Answer:

Non primitive data structure are more sophisticated data structures. Non primitive data structure are derived from the primitive data structures. Thenon-primitive data structuresemphasize on structuring of a group of homogeneous (same type) or heterogeneous (different type)dataitems.

Explanation:

pls mark me as brainliest ❣❣

Answered by surajnegi0600

Answer:

Non-primitive data structures are more complex data structures that are built using primitive data structures like arrays and linked lists.

Explanation:

The operations performed on non-primitive data structures include:

Insertion: Adding an element to the data structure. For example, inserting an element into a linked list or pushing an element onto a stack.

Deletion: Removing an element from the data structure. For example, deleting a node from a linked list or popping an element from a stack.

Searching: Finding an element in the data structure. For example, searching for a key in a binary search tree.

Traversal: Visiting all the elements of the data structure in a specific order. For example, traversing a tree in pre-order, in-order, or post-order.

Sorting: Arranging the elements of the data structure in a specific order. For example, sorting an array using bubble sort or quick sort.

Merging: Combining two or more data structures into one. For example, merging two linked lists into a single linked list.

Split: Dividing a data structure into two or more smaller data structures. For example, splitting a linked list into two linked lists based on a condition.

Reversal: Reversing the order of the elements in the data structure. For example, reversing a linked list.