Chapter Questions
Implement binary trees (Section 6.3) as an indexed collection (Section 14.4). The nodes should have a key and value field each.
Different Implementations of DictionariesImplement the class dictionary in another way than was done in Listing 14.4-7. Here are a few possibilities:1. Using binary trees (see Section 6.3)2. As an ordered list (see Section 6.1.3)3. Your own idea