I may be overcomplicating this but could you help on understanding how to work these five problems and possibly do one as an example? I have to give the indices of the elements of critter in the order that the elements are examined during a binary search...

13 GB) 35 49 62 (66) 80 pointers from each of the next stage By the same reasoning, the sub at elements to the node 49 The resulting structure is usually drawn with rigid pointers, giving it an u down tree-like shape: 62 It is called a binary search tree and is a special kind of bina tree, which is the structure studied in the rest of this chapter. Exercises 12.1 Exercises 1-5 use the following array critter: 0 1 3 4 5 7 critter[i] auk bat T cow T eel elk T fox T gnu pig rat Give the indices of the elements of critter in the order that the c examined during a binary search for 1. gnu 2. eel 3. fly 4, ant 5. yak