Lecture Recording_CH5 Trees-1
5.5 Inorder/Postorder/Preorder Traversal for Binary Trees (BT)
5.6 Copy/Equality/CountNodes for BTs,
5.9.1 Recursive Search in Binary Search Tree (BST)
[1:01'32"]
5.9.2 Insertion in Binary Search Tree (BST)
5.9.3 Deletion in BST for leaves or nodes with one subtree
[52'39"]
5.9.3 Deletion in BST for nodes with two subtrees
Tracing examples
[22'58"]
Learning On-line
某些時段Mic 沒對準導致音量較小，你可能會調大音量，此時小心回到正常音量收音時的播放音量突然大!
5.9.1 Non-Recursive Search/Insertion in BST (No stack would be involved)
[22'58"]
5.5.4 Non-recursive Traversal for Binary Trees (Stack is necessary) including inorder, preorder and postorder
[25'10"]
5.5.5 Level order traversal
Determining BT by infix+prefix, or infix_postfix
[24'02"]