Interested to Buy Any Domain ? << Click Here >> for more details...
example of linear and non-linear data structures?
- 9 Answers
- 69641 Views
- Aricent, Infosys, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / sirsendu chakraborty
The data structure is said to be a Linear data structure if
its elements are in sequence and form a linear list.
Ex. Arrays, Stacks, Queues,Linked Lists.
If the elements of data structure do not form a sequence or a
linear list then that type of data structure is called as Non-
Linear data structure.
Ex. Trees, BST(Binary Search Trees) etc.
| Is This Answer Correct ? | 300 Yes | 21 No |
Answer / bala chandra
The data structure is said to be a Linear data structure if
its elements are in sequence and form a linear list.
Ex. Arrays, Stacks, Queues,Linked Lists.
In non-linear data structures the elements are stored in
hierarchical manner.
Ex.Trees,Graphs etc..
| Is This Answer Correct ? | 78 Yes | 7 No |
Answer / guest
stack,queue-linear data structure
tree,graph-nonlinear data structure
| Is This Answer Correct ? | 37 Yes | 6 No |
Answer / santosh kumar chaudhary
A linear data structure is one in which, while traversing
sequentially, we can reach only one element directly from
another. Eg- Linked List, Array.
| Is This Answer Correct ? | 21 Yes | 8 No |
Answer / description
Linear means, in order of sequence. ex: Arrays, starts from
0 to n number of items.
Non - Linear not in an order (or) random order sequence.
ex : Search Trees
| Is This Answer Correct ? | 14 Yes | 5 No |
Answer / sneha rajput
A data structure is classified into two categories: Linear and Non-Linear data structures. A data structure is said to be linear if the elements form a sequence, for example Array, Linked list, queue etc. Elements in a nonlinear data structure do not form a sequence, for example Tree, Hash tree, Binary tree, etc.
There are two ways of representing linear data structures in memory. One way is to have the linear relationship between the elements by means of sequential memory locations. Such linear structures are called arrays. The other way is to have the linear relationship between the elements represented by means of links. Such linear data structures are called linked list.
| Is This Answer Correct ? | 4 Yes | 0 No |
Answer / siya chohan
These are single level data structure, its element forms a sequence so it is called as linear data structure.
Types of it are-
1.Stack
2.Queue
3.Link list
| Is This Answer Correct ? | 1 Yes | 0 No |
Answer / shankhasubhra mukherjee
Example of Linear Data Structure:-
Rising from one class to another like class 1,2,3,.....12.
Example of Non Linear Data Structure:-
2(x*x)+3=0 means 2(square of x)+ 3
or F(x)+f(y)=f(x)+f(y)
| Is This Answer Correct ? | 15 Yes | 17 No |
Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree (b) Complete Binary Tree.
Why is quicksort so fast?
Define graph traversals?
Tell me why can't constant values be used to define an array's initial size
Define threaded binary tree. Explain its common uses
What is mean by sorting?
Does hashmap sort automatically?
Is treeset synchronized?
What are the advantages of stack?
What does adt stands for?
Explain about set and their types in a collection?
Briefly explain recursive algorithm 50 how do you search for a target key in a linked list?
Windows 
