Change bold code snippets to inline code blocks

59-06.md

@@ -17,7 +17,7 @@ good job with Listing 59.2. Most impressively, when compiling Listing
 59.2, the compiler actually converts all right-subtree descents from
 code recursion to data recursion, by simply jumping back to the
 left-subtree handling code instead of recursively calling
-**WalkTree()**. This means that half the time Listing 59.4 has no
+`WalkTree()`. This means that half the time Listing 59.4 has no
 advantage over Listing 59.2; in fact, it's at a disadvantage because the
 code that the compiler generates for handling right-subtree descent in
 Listing 59.4 is somewhat inefficient, but the right-subtree code in
@@ -28,7 +28,7 @@ recursion than with code recursion, the advantage is only four
 instructions, because only one parameter is passed and because the
 compiler doesn't bother setting up an EBP-based stack frame, instead it
 uses ESP to address the stack. (And, in fact, this cost could be reduced
-still further by eliminating the check for a NULL **pNode** at all but
+still further by eliminating the check for a NULL `pNode` at all but
 the top level.) There are other interesting aspects to what the compiler
 does with Listings 59.2 and 59.4 but that's enough to give you the idea.
 It's worth noting that the compiler might not do as well with code