Lecture-24

書籍內容簡介

Lecture 24: More on trees HEADER NODES; THREADS Consider a binary tree T. Variations of the linked representation of T are frequently used because certain operations on T are easier to implement by using the modifications. Some of these variations, which are analogous to header and circular linked lists, are discussed in this section. Header Nodes Suppose a binary tree T is maintained in memory by means of a linked representation. Sometimes an extra, special node is called a header node is added…