返回两个节点的最低公共祖先【二叉树递归套路】

最新推荐文章于 2022-09-17 20:24:50 发布

DJL_DJL_DJL

最新推荐文章于 2022-09-17 20:24:50 发布

阅读量282

点赞数

分类专栏：经典算法专栏文章标签：算法数据结构最低公共祖先二叉树

本文链接：https://blog.csdn.net/m0_49102380/article/details/122568792

版权

经典算法专栏专栏收录该内容

35 篇文章 0 订阅

订阅专栏

题目: 给定一棵二叉树的头结点head,和另外两个节点a和b。返回a和b的最低公共祖先

题解:

 public class Code8_LowestAncestor {
	public static class Node {
		int value;
		Node left;
		Node right;

		public Node(int v) {
			value = v;
		}
	}

	public static class Info {
		boolean findA;//是否发现了a节点
		boolean findB;//是否发现了b节点
		Node ans;//搜集答案

		public Info(boolean findA, boolean findB, Node ans) {
			this.findA = findA;
			this.findB = findB;
			this.ans = ans;
		}
	}

	public static Node solve(Node head, Node a, Node b) {
		return process(head, a, b).ans;
	}

	public static Info process(Node x, Node a, Node b) {
		if (x == null)
			return new Info(false, false, null);
		Info leftInfo = process(x.left, a, b);
		Info rightInfo = process(x.right, a, b);

		boolean findA = (x == a) || leftInfo.findA || rightInfo.findA;
		boolean findB = (x == b) || leftInfo.findB || rightInfo.findB;
		Node ans = null;
		if (leftInfo.ans != null) {
			ans = leftInfo.ans;
		} else if (rightInfo.ans != null) {
			ans = rightInfo.ans;
		} else {
			if (findA && findB) {
				ans = x;
			}
		}
		return new Info(findA, findB, ans);
	}

}