## Java Software Structures: Designing and Using Data StructuresThe second edition of |

### From inside the book

Results 1-3 of 47

Page 312

10.1

technique in which a method calls itself. A key to being able to program

another method to ...

10.1

**RECURSIVE**THINKING Key Concept**Recursion**is a programmingtechnique in which a method calls itself. A key to being able to program

**recursively**is to be able to think**recursively**. We know that one method can callanother method to ...

Page 313

FIGURE 10.1 Tracing the

this definition of a list contains one option that is

not. The part of the definition that is not

FIGURE 10.1 Tracing the

**recursive**definition of a list Infinite**Recursion**Note thatthis definition of a list contains one option that is

**recursive**, and one option that isnot. The part of the definition that is not

**recursive**is called the base case.Page 317

Designing and Using Data Structures John Lewis, Joseph Chase.

Iteration Of course, there is a nonrecursive solution to the summation problem we

just explored. One way to compute the sum of the numbers between 1 and num ...

Designing and Using Data Structures John Lewis, Joseph Chase.

**Recursion**vs.Iteration Of course, there is a nonrecursive solution to the summation problem we

just explored. One way to compute the sum of the numbers between 1 and num ...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Software Development | 2 |

ObjectOriented Design | 30 |

Collections | 83 |

Copyright | |

17 other sections not shown

### Other editions - View all

Java Software Structures: Designing & Using Data Structures John Lewis,Joseph Chase No preview available - 2005 |

### Common terms and phrases

abstract add add add addElement ancestor tree array implementation ArrayList AVL tree B-tree binary search tree binary tree boolean button called Card Chapter complexity constructor contains count create data structure deckSet defined dequeue disks doubly linked list element stored empty enqueue example expression tree Figure hash table hashing function heap ImageIcon insertion insertion sort integer interface isEmpty iterator Java Collections API jss2 Key Concept left child Lewis/Chase linear linked implementation linked list loop merge sort method node null number of elements operation ordered list parameter parent path position postfix expression problem provides public class public void queue radix sort rear recursive reference variable remove represent return result Returns true right child root Self-Review Questions set collection sort algorithm stack static String subtree System.out.println target element temp tion toString traversal UML description undirected graph unordered list vertex vertices waterfall model web crawler