Read through the first section of Chapter 12. It's a correct thing to go slowly. Once I thought through 12.1, it's fairly easy to think through half of the contents of Section 12.2.
Also I found that it is a great idea to compare binary tree and heap before one moves on. Both of them are important concepts and they look alike. Also both of them are likely to be asked in interviews.
One obvious question one can ask. How many binay trees one can make given a sorted sequence of N numbers? Must be something resolved already.
Solved exercises in my head: 6.1-1, 6.1-2, 6.1-3, 12.1-1, 12.1-2, 12.1-4, 12.2-2.
Fuzzy reading: 339/1144
Browse reading: 291/1144
Exercises up to P2.2
Exercises which are finished but not on paper: P.2.2{b-d}, P2.3{a-d}, P2.4{a-d} 6.1-{1,2,3,7}, 6.2-3, 6.2-4, 10.1-6, 10.1-7, 12.1-{1,2,4} 12.2-2.
Revisit: (af Ch3) P2.1c
No comments:
Post a Comment