1. Design a procedure for finding and deleting a given value from a tree stored in the fashion. 2. In the traditional implementation of a tree, each node is constructed with a separate pointer for...

1.
Design a procedure for finding and deleting a given value from a tree stored in the fashion.

2.
In the traditional implementation of a tree, each node is constructed with a separate

pointer for each possible child. The number of such pointers is a design decision and

represents the maximum number of children any node can have. If a node has fewer children than pointers, some of its pointers are simply set to null. But such a node can never have more children than pointers. Describe how a tree could be implemented without limiting the number of children a node could have.