AP Computer Science A --> AB

<p>if you think recursion = death, sit down and try to write nonrecursive preorder, inorder, postorder, and level order traversals for a binary tree. we did that in class and it even took our teacher quite a while to figure out.</p>

<p>oh no, I know that that's impossible... but recursive MC confuses me to death...</p>

<p>1) how well you did (sorry, pet peeve) 5
2) don't they send your scores to your school??? not until after you are out
3) why would you lie? isn't that kinda lame? to make the teacher feel good, atleast for a while. So we dont have to do any more work.</p>

<p>ahh... I understand now, thanks...</p>

<p>how did everyone write the bundle class on the 2 frq? that was the only one that confused me an im not sure why b/c it was quite simple</p>