Category list

Data Structures Demystified (Demystified) - page 72

Buy on amazon.com >>

Keogh J., Davidson K.

<< Previous page

Table of contents

Index

G

get(), 195197, 225227

getDepth(), 200201

getNextKey(), 234236

getNode(), 195197

getSize(), 151, 164, 200201, 232

getTreeDepth(), 200201

Index

H

hashString(), 225, 227, 232233

hashtables

constructors and destructors, 223224

defined, 217219

developing, 220236

Hashtable class, 221223

inserting a new entry, 224225

metadata, 221

problems with hashing, 219220

removing an entry, 229232

retrieving a value, 225227

using C++, 237245

using Java, 245249

hasNext(), 234236

hexadecimal numbering system, 12

Index

I

incremental operators, 2728

index value, 33

industrial strength, 67

initIterator(), 233234

insertNodeAt(), 151, 159163

int abstract data type, 8

integer data type groups, 6, 78

isEmpty(), 120121, 135, 137

Index

J

Java

binary trees using, 212216

creating a pop member method in, 6667

creating a push member method in, 6566

enhanced LinkedList class using, 173175

hashtables using, 245249

linked list queues using, 142146

linked lists using, 109112

queues using an array in, 8991

StackLinked List using, 127128

stacks in, 6467, 7275

use of pointers, 45

Index

K

keys, 183184

See also binary trees

Index

L

linked list queues, 130133

constructors and destructors, 133

dequeue, 135138

enqueue, 134135

using C++, 138142

using Java, 142146

linked lists, 9495

appending nodes to, 100101

classes, 9899, 114116

constructors and destructors, 99100

destroying, 104105

displaying, 101103

enhanced LinkedList class, 150175

functions, 121124

header files, 121124

queues, 130146

single vs. double, 95, 9798

StackLinked List class, 116121

structure of, 96105

transversing, 103104

using C++, 105109

using Java, 109112

long abstract data type, 8, 9

Index

M

main memory. See RAM

memory, 23

addresses, 1113

allocation, 38

for attributes of a class, 21

data and, 35

dynamic memory allocation, 39

multidimensional arrays in, 4142

reserving, 511

metadata, 221

moveLeftMostNode(), 192194

multidimensional arrays, 40

assigning values to, 43

declaring, 4243

in memory, 4142

reasons to use, 4041

referencing contents of, 4344

See also arrays

Index

N

nodes, 96, 114115

appending to linked lists, 100101

in a binary tree, 179180

popping from a stacked -linked list, 118120

pushing onto a stacked-linked list, 117118

See also binary trees; linked lists

numbering system

binary, 3, 45

hexadecimal, 12

Index

O

objects, declaring, 1621

Index

P

parent-child relationships, 180

peek(), 151, 163164

persistent storage, 2, 3

pointers, 2122

accessing data pointed to, 2527

arithmetic, 2729

and arrays, 4445

arrays of, 3638, 4548

arrays of pointers to pointers, 4852

assigning addresses to, 24

data types and, 2223

declaring, 22

and Java, 45

pointer dereferencing operators, 26

to pointers, 2930, 37, 4852

popping, 58

creating a pop member in C++, 6263

creating a pop member method in Java, 6667

nodes from a stacked -linked list, 118120

See also pushing

precision, 9

primitive data types, 1617

private access specifiers, 59

processNodesInOrder(), 199200

public access specifiers, 59

pushing, 57

creating a push member in C++, 6162

creating a push member method in Java, 6566

nodes onto a stacked-linked list, 117118

See also popping

put(), 224

Buy on amazon.com >>

Keogh J., Davidson K.

<< Previous page

Table of contents

Similar products

Similar products