Windows System Programming Third Edition

EXAMPLE: SORTING FILES WITH A BINARY SEARCH TREE

129

This process is illustrated in both Figure 5–2 and Program 5–1.

Normally, programmers use the C library memory management

functions and can continue to do so if separate heaps or exception generation are

not needed.

is then equivalent to using the process heap,

to , and to . allocates and initializes

objects, and

can easily emulate this behavior. There is no C library

equivalent to

.

Example: Sorting Files with a Binary Search Tree

A search tree is a common dynamic data structure requiring memory manage-

ment. Search trees are a convenient way to maintain collections of records, and

the ...