题目7 二叉树的下一个节点
题目描述:
给定一棵二叉树和其中的一个结点,如何找出中序遍历顺序的下一个结点? 树中的结点除了有两个分别指向左右子结点的指针以外,还有一个指向父结点的指针。
题目分析:
- 若一个节点有右子树,那么它的下一个节点就是它的右子树中最左节点,也就是从右子节点出发一直沿着指向左子节点;
- 若一个节点没有右子节点,同时它是父节点的左子节点,那么它的下一节点就是父节点;
- 若一个节点既没有右子树,并且还是父节点的右子节点,那么沿着父节点一直向上 遍历,直到找到一个是它父节点的左子节点的节点,若存在就是要找的节点;
代码实现:
package swordToOffer;
public class Num7_BinaryTreeGetNextNode {
static class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode parent;
public TreeNode(int val) {
this.val =val;
}
}
public TreeNode getNextNode(TreeNode root) {
if(root==null) return null;
TreeNode target = null;
if(root.right!=null) {
TreeNode right = root.right;
while(right.left!=null) {
right = right.left;
}
target = right;
}else if(root.parent!=null) {
TreeNode current = root;
TreeNode parent = root.parent;
while(parent!=null&¤t==parent.right) {
current = parent;
parent = parent.parent;
}
target = parent;
}
return target;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Num7_BinaryTreeGetNextNode node = new Num7_BinaryTreeGetNextNode();
TreeNode node1 = new TreeNode(1);
TreeNode node2 = new TreeNode(2);
TreeNode node3 = new TreeNode(3);
TreeNode node4 = new TreeNode(4);
TreeNode node5 = new TreeNode(5);
node1.left = node2;
node2.right = node3;
node2.parent = node1;
node3.parent = node1;
node4.left = node1;
node4.right = node5;
node5.parent = node4;
node1.parent = node4;
TreeNode nextNode1 = node.getNextNode(node1);
TreeNode nextNode2 = node.getNextNode(node2);
TreeNode nextNode3 = node.getNextNode(node3);
TreeNode nextNode4 = node.getNextNode(node4);
TreeNode nextNode5 = node.getNextNode(node5);
if(nextNode1!=null)
System.out.println("node1.nextNode 1-> "+nextNode1.val);
else
System.out.println("node1.nextNode 1-> ==null "+nextNode1.val);
if(nextNode2!=null)
System.out.println("node2.nextNode 2-> "+nextNode2.val);
else
System.out.println("node2.nextNode 2-> ==null "+nextNode2.val);
if(nextNode3!=null)
System.out.println("node3.nextNode 3-> "+nextNode3.val);
else
System.out.println("node3.nextNode 3-> ==null "+nextNode3.val);
if(nextNode4!=null)
System.out.println("node4.nextNode 4-> "+nextNode4.val);
else
System.out.println("node4.nextNode 4-> ==null "+nextNode4.val);
if(nextNode5!=null)
System.out.println("node5.nextNode 5-> "+nextNode5.val);
else
System.out.println("node5.nextNode 5-> ==null ");
}
}
输出结果:
node1.nextNode 1-> 4
node1.nextNode 2-> 3
node1.nextNode 3-> 1
node1.nextNode 4-> 5
node1.nextNode 5-> ==null
考点分析
对二叉树的遍历理解,分析复杂问题的能力,画出二叉树的结构图,通过具体例子归纳总结,找出可行算法。