JAVA DATA STRUCTURES

Please answer the following:

1.) The inorder predecessor of a node N is

the largest entry in Ns left subtree

the largest entry in Ns right subtree

the smallest entry in Ns left subtree

the smallest entry in Ns right subtree

2.) In the interface SearchTreeInterface, the method getEntry returns an object in the tree that matches the given entry according to the entrys _____ method.

equalTo

equals

same

compareTo

3.) A node in a binary tree is an object that references a data object and

a linked list containing the child nodes

a vector containing the list of child nodes

two child nodes in the tree

none of the above