Write a new static method of the IntBTNode class to meet the following specification.

public static boolean has10(IntBTNode root)

// Precondition: root is the root reference of a binary tree (but

// NOT NECESSARILY a search tree).

// Postcondition: The return value indicates whether 10 appears somewhere

// in the tree. NOTE: If the tree is empty, the method returns false.

Write a new static method of the IntBTNode class to meet the following specification.

public static boolean all10(IntBTNode root)

// Precondition: root is the root reference of a binary tree (but

// NOT NECESSARILY a search tree).

// Postcondition: The return value is true if every node in the tree

// contains 10. NOTE: If the tree is empty, the method returns true.

Write a new static method of the IntBTNode class to meet the following specification. Make the method as efficient as possible (do not visit nodes unnecessarily).

public static int max(BTNode root)

// Precondition: root is the root reference of a nonempty binary SEARCH

// tree.

// Postcondition: The return value is the largest value in the tree.

A heap is a binary tree where the entries can be compared using the usual six comparison operations (that form a total order semantics). Write the two rules that the binary tree must follow in order for the structure to actually be a heap.

Suppose you have a binary search tree that contains the number 50 at a node with 2 children.Write the pseudocode to describe the process required to delete the 50 node from the tree.

What condition (situation) causes an upward reheapification to stop (be precise)?What about a downward reheapification?