Tutorial of Data Structures and Algorithms on 04/03/2019
The content of the tutorial:
The rest of the proof is in my notes, but I don't have a scanner.
Another thing is that several students asked me to explain the expected value of a random variable. To them, I strongly recommend the following material:
- INORDER-TREE-WALK is Big-Theta(n)
- Randomly built BST
The rest of the proof is in my notes, but I don't have a scanner.
Another thing is that several students asked me to explain the expected value of a random variable. To them, I strongly recommend the following material:
Comments
Post a Comment