COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
simple
|
|
|
primitive
|
|
|
self referential
|
|
|
none of above
|
Detailed explanation-1: -A self referential data structure is essentially a structure definition which includes at least one member that is a pointer to the structure of its own kind. Such self referential structures are very useful in applications that involve linked data structures, such as lists and trees.
Detailed explanation-2: -Self Referential structures are those structures that have one or more pointers which point to the same type of structure, as their member. In other words, structures pointing to the same type of structures are self-referential in nature.
Detailed explanation-3: -The self-referential structure is widely used in dynamic data structures such as trees, linked lists, and so on. The next node of a node will be pointed in linked lists, which consists of the same struct type. It is a unique type of structure containing a member of its type.