COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Uses for a tree structure include
|
|
Manipulating and searching sorted lists of data
|
|
|
Copying and saving sorted lists of data
|
|
|
Preparing the data for hashing
|
|
|
Creating an unsorted list ready for searching
|
Explanation:
Detailed explanation-1: -Applications of trees Storing naturally hierarchical data: Trees are used to store the data in the hierarchical structure. For example, the file system. The file system stored on the disc drive, the file and folder are in the form of the naturally hierarchical data and stored in the form of trees.
Detailed explanation-2: -A tree sort is a sort algorithm that builds a binary search tree from the elements to be sorted, and then traverses the tree (in-order) so that the elements come out in sorted order. Its typical use is sorting elements online: after each insertion, the set of elements seen so far is available in sorted order.
There is 1 question to complete.