编号是i的结点所在的层次号是_二叉树两个结点之间的距离

最新推荐文章于 2023-02-01 18:40:47 发布

weixin_39599317

最新推荐文章于 2023-02-01 18:40:47 发布

阅读量271

点赞数

文章标签：编号是i的结点所在的层次号是

本文链接：https://blog.csdn.net/weixin_39599317/article/details/113036835

版权

本文探讨了如何计算二叉树中任意两个节点之间的层次距离，并提供了相关的代码实现。

摘要由CSDN通过智能技术生成

二叉树两个结点之间的距离

代码实现

import java.util.LinkedList;

public class TreeNodeDistence {
    public int getTwoTreeNodeDistence(TreeNode root,TreeNode nodeOne,TreeNode nodeTwo){
         // 返回两个结点之间的距离通过公共父节点
         // 首先需要找到两个结点的公共祖先的位置，设公共祖先的位置是fatherNode.
        // 则 distence(nodeOne,nodeTwo) = distence(root,nodeOne) + distence(root,nodeTwo) - 2 * distence(root,fatherNode);
        // 所以第一步需要找到两个结点的公共父节点
        // 实现distence函数，所谓的distence函数就是在计算结点所在的层数。

        TreeNode fatherNode = findCommonFatherNode(root,nodeOne,nodeTwo);
        int x = distence(root,nodeOne) + distence(root,nodeTwo) - 2*distence(root,fatherNode);
        return x;
    }
    private int distence(TreeNode root,TreeNode node){
        // 找到node所在的层数
        int level = 0;
        LinkedList<TreeNode> queue = new LinkedList<>();
        queue.addLast(root);
        while (queue.size() > 0){
            int size = queue.size();
            level++;
            for(int i = 0;i<size;i++){
                TreeNode tempNode = queue.removeFirst();
                if (tempNode==node){
                    return level;
                }
                if (tempNode.left!=null){
                    queue.addLast(tempNode.left);
                }
                if (tempNode.right!=null){
                    queue.addLast(tempNode.right);
                }
            }
        }
        return -1;
    }

    private TreeNode findCommonFatherNode(TreeNode root,TreeNode nodeOne,TreeNode nodeTwo){
        // 递归寻找公共父节点
        if (root == null || root == nodeOne || root == nodeTwo){
            return root;
        }
        TreeNode left = findCommonFatherNode(root.left,nodeOne,nodeTwo); // 去root的左子树寻找
        TreeNode right = findCommonFatherNode(root.right,nodeOne,nodeTwo); // 去root的右子树寻找
        if (left == null && right == null){
            // 都没有找到，返回null，说明没有公共祖先
            return null;
        }
        if(left == null){
            // 左边没找到，右边找到了，说明，right就是公共祖先
            return right;
        }
        if (right == null){
            return left;
        }
        return root;
    }

    public static void main(String[] args) {
        TreeNodeDistence x = new TreeNodeDistence();
        TreeNode root = new TreeNode(1);

        root.left = new TreeNode(2);

        root.right = new TreeNode(3);

        root.left.left = new TreeNode(4);

        root.left.right = new TreeNode(5);

        root.right.left = new TreeNode(6);

        root.right.right = new TreeNode(7);

        root.right.left.right = new TreeNode(8);
        System.out.println("Dist(8,7) = " + x.getTwoTreeNodeDistence(root, root.right.left.right,root.right.right));

        System.out.println("Dist(8,3) = " +  x.getTwoTreeNodeDistence(root, root.right.left.right, root.right));

        System.out.println("Dist(8,3) = " +  x.getTwoTreeNodeDistence(root, root.right.left.right,root.left));
    }
}