Mathew is making an app that will enable one to read an e book much as is done on ordinary books where you flip trough the pages from the start and you can maneuver through both ways moving all the way to the back to see the summary by the author and the front for a glossary of items. Which will be the ideal structure for this type of a problem

The ideal structure for this type of problem would be a doubly linked list.

Step 1: Understand the Problem In the given scenario, the user should be able to navigate both forwards and backwards through the pages of the e-book. This is similar to how one would flip through the pages of a physical book, moving from the start to the end, and vice versa.

Step 2: Identify the Ideal Data Structure A doubly linked list is a type of data structure that can help solve this problem. In a doubly linked list, each node contains a data part and two pointers that point to the next and the previous node in the sequence. This allows for bidirectional traversal through the list.

Step 3: Apply the Data Structure In the context of the e-book app, each page of the book can be considered a node in the doubly linked list. The 'next' pointer of a node would point to the subsequent page, while the 'previous' pointer would point to the preceding page. This would allow the user to move forwards and backwards through the e-book, much like flipping through the pages of a physical book.

Step 4: Implement Additional Features With the basic navigation structure in place, additional features such as accessing the summary or the glossary can be implemented. These could be placed at the start and end of the doubly linked list respectively, allowing the user to quickly navigate to these sections.

In conclusion, a doubly linked list would be the ideal data structure for this problem due to its ability to facilitate bidirectional navigation.