Advanced Data Structures Checkpoint

1. What does a trie node usually store?

Children map and end-of-word flag Sorted array only Heap of characters Only a hash of the word

2. Fenwick tree prefix sums run in:

3. In a Fenwick tree, internal indices are typically:

0-indexed 1-indexed 2-indexed unordered