LITMIR.BIZ

Скачать книгу

to the rear and remove them from the f...Figure 12.2 The primary operations of queues are enqueueing and dequeueing....Figure 12.3 Queue operation run timesFigure 12.4 When there is one item in your queue, it is both the front and t...Figure 12.5 Now the node with 1 in it is the front, and the node with 2 in i...Figure 12.6 The node with 1 in it is the front, and the node with 3 in it is...Figure 12.7 When you dequeue the 1, the front changes to the node with 2 in ...Figure 12.8 When you dequeue again, there is only one item left, so it is bo...Figure 12.9 Now your queue is empty.

      10 Chapter 13Figure 13.1 A hash table stores key-value pairs in an array.Figure 13.2 To store 86 in the hash table, you perform modulo by the number ...Figure 13.3 To store 90 in the hash table, you perform modulo by the number ...Figure 13.4 Your hash table after adding all the numbersFigure 13.5 Hash table operation run times

      11 Chapter 14Figure 14.1 An example of a tree data structureFigure 14.2 A tree with a root node, parent nodes, child nodes, and edgesFigure 14.3 A path through a treeFigure 14.4 In a binary tree, a parent node can have only two child nodes.Figure 14.5 An example of a binary search treeFigure 14.6 A simple tree showing the root node, A, and its descendantsFigure 14.7 Binary search trees operation run timesFigure 14.8 An example of folders in a treeFigure 14.9 The document object modelFigure 14.10 A tree for evaluating a mathematical expressionFigure 14.11 A binary tree with five nodesFigure 14.12 Levels in a binary treeFigure 14.13 A book represented as a treeFigure 14.14 A postorder tree traversalFigure 14.15 An in-order tree traversal

      12 Chapter 15Figure 15.1 You create a binary heap using a binary tree.Figure 15.2 A max heap has the highest priority node as the root.Figure 15.3 A min heap has the lowest priority node as the root.Figure 15.4 The result of heapifying an arrayFigure 15.5 Swapping values to balance a heapFigure 15.6 Swapping D and T is the first step to balance this he...Figure 15.7 The left side of the heap was already balanced.Figure 15.8 Balancing the tree at the next levelFigure 15.9 C is now the root node in your binary heap.Figure 15.10 The R node trickles down the tree as long as it has a larger va...Figure 15.11 A balanced heapFigure 15.12 An array with keys at indexes based on their position in the tr...Figure 15.13 The right child of the root is at index 2.

      13 Chapter 16Figure 16.1 A graph contains vertices, edges, payloads, and weight.Figure 16.2 A directed graph moves in a specific direction.Figure 16.3 An undirected graph can move in either direction.Figure 16.4 A complete graph has connections among all vertices.Figure 16.5 An incomplete graph has some connected vertices.Figure 16.6 A graph path follows a specific sequence.Figure 16.7 An example of a graph that contains a cycleFigure 16.8 A graph with four verticesFigure 16.9 An adjacency matrix of the graph in Figure 16.8Figure 16.10 Graphs can represent 3D shapes.Figure 16.11 A graph with four verticesFigure 16.12 Set the path to the starting vertex to zero and the other paths...Figure 16.13 What the data structures in your algorithm look like when it fi...Figure 16.14 The data structures after visiting vertex AFigure 16.15 The data structures after visiting vertex BFigure 16.16 The data structures after visiting vertex CFigure 16.17 The data structures after visiting vertex D

      Guide

      1  Cover

      2  Table of Contents

      3  Begin Reading

      Pages

      1  i

      2  xiv

      3  xv

      4  xvi

      5  xvii

      6  xviii

      7  xix

      8  xx

      9  xxi

      10  xxii

      11  1

      12  3

      13  4

      14  5

      15  6

      16  7

      17  8

      18  9

      19  10

      20  11

      21  12

      22  13

      23  14

      24  15

      25  16

      26  17

      27 18

      28  19

      29  20

      30  21

      31  22

      32  23

      33  25

      34  26

      35  27

      36  28

      37  29

      38  30

      39  31

      40  32

      41 

Скачать книгу