Skip to content

Latest commit

 

History

History
18 lines (13 loc) · 697 Bytes

File metadata and controls

18 lines (13 loc) · 697 Bytes

Non-Linear Data Structures

  • Elements are not alligned sequentially
  • Elements cannot be accessed in a single run because they arranged in multiple levels
  • They utilize system memory efficiently as compared to linear data structures
  • Not easy for implementation
  • Time complexity of non-linear data structures often remains the same no matter the size of the input

Advantages of non-linear data structures

1. Memory utilization is effective because there is no need to declare memory in advance.

Disadvantages

2. Not easy to implement.

Examples of Non-Linear Data Structures.