Skip to Content
Java How to Program, Early Objects, 11th Edition
book

Java How to Program, Early Objects, 11th Edition

by Paul J. Deitel, Harvey Deitel
June 2017
Beginner
1296 pages
69h 23m
English
Pearson
Content preview from Java How to Program, Early Objects, 11th Edition

Summary

Section 21.1 Introduction

  • Dynamic data structures (p. 847) can grow and shrink at execution time.

  • Linked lists (p. 847) are collections of data items “linked up in a chain”—insertions and deletions can be made anywhere in a linked list.

  • Stacks (p. 847) are important in compilers and operating systems—insertions and deletions are made only at the top (p. 847) of a stack.

  • In a queue, insertions are made at the tail (p. 847) and deletions are made from the head (p. 847).

  • Binary trees (p. 847) facilitate high-speed searching and sorting, eliminating duplicate data items efficiently, representing file-system directories and compiling expressions into machine language.

Section 21.2 Self-Referential Classes

  • A self-referential class ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Beginning Java 17 Fundamentals: Object-Oriented Programming in Java 17

Beginning Java 17 Fundamentals: Object-Oriented Programming in Java 17

Kishori Sharan, Adam L. Davis
Learning Java, 5th Edition

Learning Java, 5th Edition

Marc Loy, Patrick Niemeyer, Daniel Leuck
Java in a Nutshell, 8th Edition

Java in a Nutshell, 8th Edition

Benjamin J. Evans, Jason Clark, David Flanagan

Publisher Resources

ISBN: 9780134751962