Data Abstraction and Problem Solving with JAVA: Data Abstraction and Problem Solving with JAVA: Walls and MirrorsWalls and Mirrors TreesTrees

(1)

Data Abstraction and Problem Solving with JAVA:

Walls and Mirrors Walls and Mirrors

Carrano / Prichard Carrano / Prichard

Trees

(2)

A general tree

(3)

A subtree of the tree in Figure 10.1

(4)

a) An organization chart; b) a family tree

(5)

Binary trees that represent algebraic expressions

(6)

A binary search tree of names

(7)

Binary trees with the same nodes but different heights

(8)

A full binary tree of height 3

(9)

A complete binary tree

(10)

Traversals of a binary tree: a) preorder; b) inorder; c) postorder

(11)

a) A binary tree of names

(12)

b) its array-based

implementations

(13)

Level-by-level numbering of a complete binary tree

(14)

An array-based implementation of the complete binary tree in Figure 10-11

(15)

A reference-based implementation of a binary tree

(16)

Contents of the implicit stack as treeNode progresses through a given tree

during a recursive inorder traversal

(17)

Traversing a) the left and b) the right subtrees of 20

(18)

Avoiding returns to nodes B and C

(19)

A binary search tree

(20)

Binary search trees with the same data as in Figure 10-17

(21)

Binary search trees with the same data as in Figure 10-17

(22)

Binary search trees with the same data as in Figure 10-17

(23)

An array of names in sorted order

(24)

Empty subtree where search terminates

(25)

a) Insertion into an empty tree; b) search terminates at a leaf

(26)

c) insertion at a leaf

(27)

a) N with only a left child—N can be either the left or right child of P; b) after

deleting node N

(28)

N with two children

(29)

Not any node will do

(30)

Search key x can be replaced by y

(31)

Copying the item whose search key is the inorder successor of N ’s search key

(32)

Recursive deletion of node N

(33)

A maximum-height binary tree with seven nodes

(34)

Binary trees of height 3

(35)

Counting the nodes in a full binary tree of height h

(36)

Filling in the last level of a tree

(37)

The order of the retrieval, insertion, deletion, and traversal operations for the

reference-based implementation of the ADT binary search tree

(38)

a) A binary search tree bst; b) the sequence of insertions that result in this tree

(39)

A full tree saved in a file by using inorder traversal

(40)

A tree of minimum height that is not complete

(41)

A general tree

(42)

A reference-based implementation of the general tree in Figure 10.36

(43)

The binary tree that Figure 10-37 represents

(44)

An implementation of the n-ary tree in Figure 10.36

(45)

A tree for Self-Test Exercises 1, 3, 7, and 11 and for Exercises 6 and 11

(46)

An array for Self-Test Exercise 9

(47)

A tree for Self-Test Exercise 10 and for Exercise 2a

(48)

A binary search tree for Exercise 3

(49)

Data Abstraction and Problem Solving with JAVA: Data Abstraction and Problem Solving with JAVA: Walls and MirrorsWalls and Mirrors TreesTrees

Data Abstraction and Problem Solving with JAVA:

Data Abstraction and Problem Solving with JAVA:

Walls and Mirrors Walls and Mirrors

Carrano / Prichard Carrano / Prichard

Trees

Trees

A general tree

A subtree of the tree in Figure 10.1

a) An organization chart; b) a family tree

Binary trees that represent algebraic expressions

A binary search tree of names

Binary trees with the same nodes but different heights

A full binary tree of height 3

A complete binary tree

Traversals of a binary tree: a) preorder; b) inorder; c) postorder

a) A binary tree of names

b) its array-based

implementations

Level-by-level numbering of a complete binary tree

An array-based implementation of the complete binary tree in Figure 10-11

A reference-based implementation of a binary tree

Contents of the implicit stack as treeNode progresses through a given tree

during a recursive inorder traversal

Traversing a) the left and b) the right subtrees of 20

Avoiding returns to nodes B and C

A binary search tree

Binary search trees with the same data as in Figure 10-17

Binary search trees with the same data as in Figure 10-17

Binary search trees with the same data as in Figure 10-17

An array of names in sorted order

Empty subtree where search terminates

a) Insertion into an empty tree; b) search terminates at a leaf

c) insertion at a leaf

a) N with only a left child—N can be either the left or right child of P; b) after

deleting node N

N with two children

Not any node will do

Search key x can be replaced by y

Copying the item whose search key is the inorder successor of N ’s search key

Recursive deletion of node N

A maximum-height binary tree with seven nodes

Binary trees of height 3

Counting the nodes in a full binary tree of height h

Filling in the last level of a tree

The order of the retrieval, insertion, deletion, and traversal operations for the

reference-based implementation of the ADT binary search tree

a) A binary search tree bst; b) the sequence of insertions that result in this tree

A full tree saved in a file by using inorder traversal

A tree of minimum height that is not complete

A general tree

A reference-based implementation of the general tree in Figure 10.36

The binary tree that Figure 10-37 represents

An implementation of the n-ary tree in Figure 10.36

A tree for Self-Test Exercises 1, 3, 7, and 11 and for Exercises 6 and 11

An array for Self-Test Exercise 9

A tree for Self-Test Exercise 10 and for Exercise 2a

A binary search tree for Exercise 3

A minimax tree for Exercise 17