Memory Management with Linked Lists Before x terminates After X terminates (a)AX becomes A绕B (b)AX becomes A x⊥B becomes B becomes Figure 3-7. Four neighbor combinations for the terminating process, X Tanenbaum, Modern Operating Systems 3 e, (c)2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639Figure 3-7. Four neighbor combinations for the terminating process, X. Memory Management with Linked Lists Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639