Chapter 6: Binary Tree Traversal
Part 1 of the lecture. I stopped recording, and, idiot that I am, forgot to resume it, so I will have to re-record that part of the lecture and put it up later.
00:00 Introduction
00:55 Preorder traversal
01:30 Code for preorder
05:00 Postorder traversal
08:08 Inorder traversal
11:50 Evaluating a parse tree expression
18:20 Eliminating unnecessary parentheses
22:14 Convert Binary Tree to String (unsuccessful attempt)
26:25 Priority Queues
29:27 Binary Search Tree
31:00 Insert into Binary Search Tree
35:19 Code for Binary Search Tree