求二叉树两个节点之间的距离_二叉树的两个给定节点之间的最小距离

求二叉树两个节点之间的距离

Problem statement:

问题陈述：

Given a binary tree, and two node values your task is to find the minimum distance between them.

给定一棵二叉树和两个节点值，您的任务是找到它们之间的最小距离 。

Node values are unique.

节点值是唯一的。

Example:

例：

Let the two nodes to be 9 and 2, their min distance is 3, In case of 4 and 3 their min distance is 2.

设两个节点为9和2 ，它们的最小距离为3 ，在4和3的情况下，它们的最小距离为2 。

Solution:

解：

One naïve idea can be searching for either of the nodes using BFS. Once either of the nodes is found, corresponding node is marked. We start searching for the other node incrementing distance. But one problem is result always is not guaranteed to be minimum.

一个天真的想法可以是使用