Starting Out with C++ from Control Structures to Objects (9th Edition)
Starting Out with C++ from Control Structures to Objects (9th Edition)
9th Edition
ISBN: 9780134498379
Author: Tony Gaddis
Publisher: PEARSON
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 18, Problem 4RQE

Explanation of Solution

Self-referential data structure:

It is a data structure, contains sequence of elements which includes at least one pointer variable in type of its own kind.

The purpose of the self-referential data structure is that each variable maintains a link to another variable of the same type to forming a non-contiguous data structure. It is otherwise called as linked list.

It can be implemented to form other data structures such as list, stacks, queues and trees...

Blurred answer
Students have asked these similar questions
What is a self-referential data structure?
What is the definition of a self-referential data structure?
How does one-way data binding differ from two-way data binding?