Misc/abrash-black-book
Watch
1
0
Fork
You've already forked abrash-black-book
 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Retidy, removing align=left from headings and empty paragraphs

Browse source
This commit is contained in:
James Gregory 2013-12-30 15:37:13 +11:00
commit a96a114403
362 changed files with 8472 additions and 5040 deletions
Download patch file Download diff file Expand all files Collapse all files

33
59-04.html
View file

@ -1,5 +1,4 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<!DOCTYPE html>
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
@ -19,17 +18,21 @@
<center>
<table border="1">
<tr>
<td><a href="59-03.html">Previous</a></td>
<td>
<a href="59-03.html">Previous</a>
</td>
<td><a href="index.html">Table of Contents</a></td>
<td>
<a href="index.html">Table of Contents</a>
</td>
<td><a href="59-05.html">Next</a></td>
<td>
<a href="59-05.html">Next</a>
</td>
</tr>
</table>
</center>
<p><br /></p>
<h3 id="Heading8">Inorder Walks of BSP Trees</h3>
<p>It was implementing BSP trees that got me to thinking about inorder tree traversal. In inorder traversal, the left subtree of each node gets visited first, then the node, and then the right subtree. You apply this sequence recursively to each node and its children until the entire tree has been visited, as shown in Figure 59.9. Walking a BSP tree is basically an inorder tree walk; the only difference is that with a BSP tree a decision is made before each descent as to which subtree to visit first, rather than simply visiting whatever&rsquo;s pointed to by the left-subtree pointer. Conceptually, however, an inorder walk is what&rsquo;s used to traverse a BSP tree; from now on I&rsquo;ll discuss normal inorder walking, with the understanding that the same principles apply to BSP trees.</p>
@ -87,7 +90,7 @@ struct _NODE *pRightChild;
<p>And yet, a data-recursive inorder walk implementation has exactly the same flowchart and <i>exactly</i> the same functionality as the code-recursive version they&rsquo;ve already written. They already have a fully functional model to follow, with all the problems solved, but they can&rsquo;t make the connection between that model and the code they&rsquo;re trying to implement. Why is this?</p>
<h4 align="left" id="Heading9">Know It <i>Cold</i></h4>
<h4 id="Heading9">Know It <i>Cold</i></h4>
<p>The problem is that these people don&rsquo;t understand inorder walking through and through. They understand the concepts of visiting left and right subtrees, and they have a general picture of how traversal moves about the tree, but they do not understand exactly what the code-recursive version does. If they really comprehended everything that happens in each iteration of <b>WalkTree()</b>&mdash;how each call saves the state, and what that implies for the order in which operations are performed&mdash;they would simply and without fuss implement code like that in Listing 59.4, working with the code-recursive version as a model.</p>
@ -165,16 +168,20 @@ void WalkTree(NODE *pNode)
</pre>
<p><br /></p>
<center>
<table border="1">
<tr>
<td><a href="59-03.html">Previous</a></td>
<td>
<a href="59-03.html">Previous</a>
</td>
<td><a href="index.html">Table of Contents</a></td>
<td>
<a href="index.html">Table of Contents</a>
</td>
<td><a href="59-05.html">Next</a></td>
<td>
<a href="59-05.html">Next</a>
</td>
</tr>
</table>
</center>