Reema Thareja

Index Terms Links

operation 47 125 126 127
128 12
arrays 71
binary search 424
deletion 79 127
insertion 76 125
replacement 128
linear search 424
merging 82
searching 424
traversal 71
operations on a stack 221
peep
pop 222 11
push 221
operators 221

assignment 9 10
bitwise 13 14
equality 13
comma 12
conditional 10
logical 14
precedence chart 12
relational 10
sizeof 14
unary 10
out-degree 14
11
280 282

P

path 280 282

peep operation 47

pointer to pointers 37

This page has been reformatted by Knovel to provide easier navigation.

Index Terms Links

pointers 34 132
arrays 90
generic pointers 36

null pointers 36
pointer arithmetic 36
strings 132
polynomial representation 211
pop operation 47
primary key 45
printf()
priority queue 8
array representation 268 269 270
deletion 270
implementation 270
insertion 269
linked representation 269
programming language 269
push operation
51
47

Q

quadratic loop 56

queue 44 47 253 254
260
256 257

applications 275

array representation 254

circular queues 260

delete 258

deques 264

insert 257

linked representation 256

multiple queues 272

operations 254 257

priority queues 268

This page has been reformatted by Knovel to provide easier navigation.

Index Terms Links

queue (Cont.) 260
types

R

record 45 490
recursion 247
247
direct 247
indirect 248
linear and tree 247
tail 243
recursive functions 327
red-black tree 337
applications 330
operations 328
properties
relational operators 10
repetition 52
representation of binary trees 283
linked representation 283
sequential representation 285
right-heavy tree 317
right successor 281
RL rotation 318
root node 279
RR rotation 318

S

scanf() 7
searching 49
426
binary search 433
Fibonacci search 428
interpolation search

This page has been reformatted by Knovel to provide easier navigation.

Index Terms Links

searching (Cont.) 430
jump search 424
linear search 155
52
self-referential structures 13
sequence 405
shift operators 413
shortest path algorithms 409
405
Dijkstra’ s algorithm 417
Kruskal’s algorithm 407
minimum spanning trees 414
modified Warshall’s algorithm 167
Prim’s algorithm 167
Warshall’s algorithm 167
singly linked list 49 433
Garbage collection 434
traversing 454
sorting 438
bubble sort 443
heap sort 446
insertion sort
merge sort 450
quick sort 440
456
radix sort 458
selection sort 54 399
shell sort 406
tree sort 110
space complexity 338
spanning tree 338
sparse matrices 339
splaying 338
zig step
zig-zag step
zig-zig step

This page has been reformatted by Knovel to provide easier navigation.

Index Terms Links

splay trees 337
stacks 44 47 219 220

applications 224
array representation 230
linked representation 220
multiple stacks 224
operations 227
strings 221
operations 115 117 118
reading 118
writing 117
structure 118
accessing the members 138 140 141 158
comparing 141
copying 142
copying structures 142
declaration 142
initialization 138
nested structures 140
typedef 144
unions 139
structures and functions 158
subscript 148
sub-trees 46
279
T
385
terminology 491
text file 61
theta notation (θ) 311
threaded binary tree

This page has been reformatted by Knovel to provide easier navigation.

Index Terms Links

time complexity 54 399
amortized 54
average-case 54
best-case 54
worst-case 54
51
top-down approach 400
topological sorting 286
tournament trees 386
transitive closure 49 287
traversing 280 294 298
trees

applications 294
binary search 298
binary search trees 285
binary trees 281
binomial 365
complete binary trees 282
expression trees 285
extended binary trees 283
general trees 280
representation of binary trees 283
terminology 281
tournament trees 286
trie 358

advantages 358
applications 359
disadvantages 358
two-dimensional arrays
accessing 93 99
declaring 96
initializing 93
operations 95
typecasting 99
16

This page has been reformatted by Knovel to provide easier navigation.

Index Terms Links

type conversion 16
typedef declarations 139
type specifiers
7
U
11
unary operators 155
unions 156
156
accessing a member 156
declaring
initializing 34
4
V 4
49
variables 36
character
numeric 414
54
vertices
void pointer

W

Warshall’s algorithm
worst-case running time

This page has been reformatted by Knovel to provide easier navigation.