COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Linear List
|
|
|
Linked List
|
|
|
Stacks
|
|
|
Trees
|
|
|
Pseudocodes
|
Detailed explanation-1: -Another example of a tree structure that you probably use every day is a file system. In a file system, directories, or folders, are structured as a tree.
Detailed explanation-2: -Some examples of Data Structures are Arrays, Linked Lists, Stack, Queue, Trees, etc. Data Structures are widely used in almost every aspect of Computer Science, i.e., Compiler Design, Operating Systems, Graphics, Artificial Intelligence, and many more.
Detailed explanation-3: -The tree is a nonlinear hierarchical data structure and comprises a collection of entities known as nodes. It connects each node in the tree data structure using “edges”, both directed and undirected.
Detailed explanation-4: -Trees are commonly used to represent or manipulate hierarchical data in applications such as: File systems for: Directory structure used to organize subdirectories and files (symbolic links create non-tree graphs, as do multiple hard links to the same file or directory)