1. Write and implement a function get Width that takes a binary tree as input and calculates the largest number of nodes in a level. 2. Implement the ADT queue operations as well as a sorted traversal...

1. Write and implement a function get Width that takes a binary tree as input and calculates the largest number of nodes in a level.

2. Implement the ADT queue operations as well as a sorted traversal operation for a queue that points into a doubly linked binary search tree, as shown in Figure 16-21 . Doubly linked binary trees are explained in Exercise 16. You will need the insertion and removal operations for a binary search tree that contains parent pointers.