Absolute JavaBest-selling author Walt Savitch offers students a comprehensive introduction of the java programming language. The hallmark feature of his accessible writing style is predominate in this text, along with the needed tools and java topics for novice and experienced programmers to master the java language. In this second edition he takes full advantage of the new java 5.0 features and incorporates the new Scanner class, automatic boxing and unboxing, System.out.pintf for formatting output and enhanced for loop. There is comprehensive coverage of generic types, including how to define classes with type parameters, collection classes done as generic classes, and linked lists done with type parameters. Pedagogical features are integrated throughout including: pitfalls, programming tips, and self-test exercises and answers. This book is appropriate for introductory courses covering Java and intermediate programming courses introducing Java to students familiar with another language. |
From inside the book
Results 1-3 of 41
... thing is done in Java , we will construct our own simplified example of a linked list . After discussing linked lists we then go on to discuss trees , a more elaborate linked data structure . Display 15.1 Nodes and Links in a Linked List ...
Walter J. Savitch. empty list WORKING WITH LINKED LISTS When dealing with a linked list , your code needs to be able to " get to " that first or head node , and you need some way to detect when the last node is reached . To get your code ...
Walter J. Savitch. Indicating the End of a Linked List The last node in a linked list should have its link instance variable set to null . That way , your code can check whether a node is the last node by checking whether its link ...