I'm pretty familiar with stacks and queues, and this section seemed more helpful in the realm of formulas and propositions than the last. I had a hard time on the last section in some ways because we didn't have many hard and fast formulas like Poposition 3.2.7 "G is a tree if an only if |E| = n - 1".
While stacks and queues are straightforward data structures, some of the other tree structures, such as AVL trees, are pretty complicated (maybe not so much conceptually, but definitely more complicated when it comes to coding it up), so I'm not really looking forward to the next section....
No comments:
Post a Comment