What is a Data Structure? Explain the difference between linear and non-linear data structures with one example each.

A Data Structure is a way to organize and store data in a computer so that it can be accessed and modified efficiently.

Data structures enable you to manage large amounts of information and perform operations like searching, sorting, and inserting.

Now, let's quickly differentiate between linear and non-linear data structures:

1. Linear Data Structures

In these structures, the elements are arranged in a sequential manner, and each element is connected to its previous and next element. A common example is a List in Python. Lists allow you to store multiple items in a defined order, and you can access elements by their index.

my_list = [1, 2, 3, 4]

2. Non-Linear Data Structures

Here, data elements are not arranged sequentially. Instead, elements can relate to multiple other elements. A prime example is a Tree. Trees consist of nodes, where each node may have multiple child nodes, creating a hierarchy.

class TreeNode:
    def __init__(self, value):
        self.value = value
        self.children = []  # This can hold multiple children

Hope this helps to clarify the concepts! Let me know if you have more questions.