二叉树——任意节点的后继节点

最新推荐文章于 2024-06-20 20:20:21 发布

我是菜鸟马力

最新推荐文章于 2024-06-20 20:20:21 发布

阅读量78

点赞数 1

分类专栏：数据结构与算法（Java）文章标签： java 算法开发语言

本文链接：https://blog.csdn.net/qq_43545653/article/details/137351831

版权

数据结构与算法（Java）专栏收录该内容

53 篇文章 0 订阅

订阅专栏

//找到一个节点的后继节点
public class SuccessorNode {

	//该节点比较特殊，记录了父节点的信息
	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 Node getSuccessorNode(Node node) {
		//如果节点为null，返回该节点
		if (node == null) {
			return node;
		}
		//如果该节点的右节点不为空，获取该右节点的最深左节点
		if (node.right != null) {
			return getLeftMost(node.right);
		} else {
			//获取当前节点的父节点，当父节点不为空且父节点的左子节点不为当前节点，获取当前节点的父节点
			Node parent = node.parent;
			while (parent != null && parent.left != node) {
				node = parent;
				parent = node.parent;
			}
			return parent;
		}
	}

	//获取某个节点的最深左节点
	public static Node getLeftMost(Node node) {
		//如果节点为空，返回该节点
		if (node == null) {
			return node;
		}
		//当左节点不为空，遍历查询所有的左节点
		while (node.left != null) {
			node = node.left;
		}
		return node;
	}

	public static void main(String[] args) {
		Node head = new Node(6);
		head.parent = null;
		head.left = new Node(3);
		head.left.parent = head;
		head.left.left = new Node(1);
		head.left.left.parent = head.left;
		head.left.left.right = new Node(2);
		head.left.left.right.parent = head.left.left;
		head.left.right = new Node(4);
		head.left.right.parent = head.left;
		head.left.right.right = new Node(5);
		head.left.right.right.parent = head.left.right;
		head.right = new Node(9);
		head.right.parent = head;
		head.right.left = new Node(8);
		head.right.left.parent = head.right;
		head.right.left.left = new Node(7);
		head.right.left.left.parent = head.right.left;
		head.right.right = new Node(10);
		head.right.right.parent = head.right;

		Node test = head.left.left;
		System.out.println(test.value + " next: " + getSuccessorNode(test).value);
		test = head.left.left.right;
		System.out.println(test.value + " next: " + getSuccessorNode(test).value);
		test = head.left;
		System.out.println(test.value + " next: " + getSuccessorNode(test).value);
		test = head.left.right;
		System.out.println(test.value + " next: " + getSuccessorNode(test).value);
		test = head.left.right.right;
		System.out.println(test.value + " next: " + getSuccessorNode(test).value);
		test = head;
		System.out.println(test.value + " next: " + getSuccessorNode(test).value);
		test = head.right.left.left;
		System.out.println(test.value + " next: " + getSuccessorNode(test).value);
		test = head.right.left;
		System.out.println(test.value + " next: " + getSuccessorNode(test).value);
		test = head.right;
		System.out.println(test.value + " next: " + getSuccessorNode(test).value);
		test = head.right.right; // 10's next is null
		System.out.println(test.value + " next: " + getSuccessorNode(test));
	}

}