(1)、在二叉树中找到一个节点的后继节点
【题目】 现在有一种新的二叉树节点类型如下:
public class Node {
public int value;
public Node left;
public Node right;
public Node parent;
public Node(int data) {
this.value = data;
}
}
该结构比普通二叉树节点结构多了一个指向父节点的parent指针。假设有一棵Node类型的节点组成的二叉树,树中每个节点的parent指针都正确地指向自己的父节点,头节点的parent指向null。只给一个在二叉树中的某个节点node,请实现返回node的后继节点的函数。在二叉树的中序遍历的序列中, node的下一个节点叫作node的后继节点。
找到二叉树中某节点的前继节点
public class Demo {
public static class Node {
public int value;
public Node left;
public Node right;
public Node parent;
public Node(int data) {
this.value = data;
}
}
public static void main(String[] args) {
Node node = new Node(1);
node.left = new Node(2);
node.left.parent = node;
node.left.left = new Node(4);
node.left.left.parent = node.left;
node.left.right = new Node(5);
node.left.right.parent = node.left;
node.right = new Node(3);
node.right.parent = node;
node.right.left = new Node(6);
node.right.left.parent = node.right;
node.right.right = new Node(7);
node.right.right.parent = node.right;
Node node1 = findNode(node.right.right);
if(node1 == null){
System.out.println("null");
}else{
System.out.println(node1.value);
}
}
public static Node findNode(Node node) {
if (node =