(1) Implement a function that returns the successor of a node in a binary search tree (the BST stores integer keys). A successor of a node n is defined as the smallest key x in the BST such that x is bigger than the value of n, or null if that does not exist. You may assume that the BST does not contain duplicate keys. The implementation class may contain the following functions:

class TreeNode {

int getValue();

TreeNode getLeft();

TreeNode getRight();

TreeNode getParent(); }

int findSuccessor(TreeNode x) {

......;

(2) Write a C code to perform a word wise string sorting in linked list. The linked list would be formed by reading the string from a file line by line. The sorted string will be written out to the output file in line-by-line. Example:

Given string: this is a code

Output string: ihst is a cdeo