【算法】求一个节点的后继节点(中序遍历)

public class Node {
public V value;
public Node left;
public Node right;
public Node parent;

public Node(V value) {
    this.value = value;
}

}