Using Java Please Trees can be implemented as arrays or dyna

Using Java Please

Trees can be implemented as arrays or dynamic data structures with nodes that contain references to other nodes, but the array is particularly appropriate for the complete binary tree because of the conditions that require the nodes of a complete tree to occur in specific locations The depth of a heap or B-tree is never more than O (log n), so operations on these structures are also O (log n). An algorithm is a step-by-step method bv which elements of the desired input set are mapped to elements of the legal output set. Having a pop occur when a stack is empty is known as a \"stack overflow\" error. Recursion provides for a more elegant and quicker solution for most problems. The Stack implementation using an array is considered a dynamic data structure

Solution

1) True since a complete binary tree will be in the order of 2ⁿ-1. Hence it is easy to do with arrays

2) False Since

At each node, we do O(log m) work to choose branch.

An insert or delete may need O(m) work to fix up info in a node

3) True as we go in a sequential Manner

4) False it is underflow as overflow occurs when we want to insert element and stack is full

5) True for many cases but Not in all cases.

6) It is a static data structure as we have to manually increase the size as per our convenience