Put a different value in each node. Each node also has a reference to its parent. Store the references to the children in an array of four components. Using the BTNode class from Chapter 9, write a new static method of the BTNode class to meet the following specification. No recursion is needed.
Root is the root reference of a binary tree.
Using the BTNode class from Chapter 9, write a new static method of the BTNode class to meet the following specification. Root is the root reference of a binary tree. Write a new static method of the IntBTNode class to meet the following specification. Redo the previous problem as a new non-static BTNode method. Using the BTNode class from Chapter 9, write a new static method of the BTNode class to meet the following specification.