attendance & agenda
present : Alice (study lead), Bob, Charlie
- Alice
- Bob
- Charlie
agenda :
- review unfinished business from last week
- learn binary search tree insertion and deletion
- assign leetcode practice problems
unfinished business
from the last session, we still need to review merge sort time complexity
Charlie mentioned that we really need to practice dynamic programming soon before the midterm
new business
we went over edge cases for tree traversals. the group agreed that understanding the difference between pre-order and post-order traversal is absolutely mandatory for the exam
Bob suggested going over Dijkstra's algorithm, but we decided to hold off on that until next week's graph theory session
miscellaneous comments & questions
Alice asked if we should write our practice solutions in Python or Java. we will vote on this in the group chat
media & diagrams
architecture diagram (binary search tree) :
meeting video recording (BST tutorial) :
meeting audio recording (BST audio extracted) :