给定一个节点，找出它是第几层第几个！

最新推荐文章于 2024-01-05 17:35:30 发布

小纸人人

最新推荐文章于 2024-01-05 17:35:30 发布

阅读量1.2k

点赞数

分类专栏：二叉树

本文链接：https://blog.csdn.net/zzr2018xzy/article/details/100713551

版权

二叉树专栏收录该内容

13 篇文章 0 订阅

订阅专栏

本文介绍如何通过层次遍历算法，给定一个树结构中的节点，精确地找出它所在的层级和该层级中的位置。层次遍历通常使用广度优先搜索实现，通过队列来存储节点，并记录每层的节点数量。

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

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;

public class Main {

    public static class TreeNode {
        public int val;
        public TreeNode left;
        public TreeNode right;

        public TreeNode(int data) {
            this.val = data;
        }
    }
    //在二叉树中寻找一个节点，判断是第几层第几个
    public static void findNodeInlevelIndex(TreeNode pRoot, int k) {
        int level = 1;
        Queue<TreeNode> layer = new LinkedList<TreeNode>();
        ArrayList<Integer> layerList = new ArrayList<Integer>();
        layer.add(pRoot);
        int start = 0, end = 1;
        while (!layer.isEmpty()) {
            TreeNode cur = layer.remove();
            if(cur.val==k){
                System.out.println("层数是"+level+",下标是"+(start+1));
            }
            layerList.add(cur.val);
            start++;
            if (cur.left != null) {
                layer.add(cur.left);
            }
            if (cur.right != null) {
                layer.add(cur.right);
            }
            if (start == end) {
                end = layer.size();
                start = 0;
                layerList = new ArrayList<Integer>();
                level++;
            }
        }

    }

    public static void main(String[] args) {
        TreeNode head = new TreeNode(1);
        head.left = new TreeNode(2);
        head.right = new TreeNode(3);
        head.left.left = new TreeNode(4);
        head.left.right = new TreeNode(5);
        head.right.left = new TreeNode(6);
        head.right.right = new TreeNode(7);
        findNodeInlevelIndex(head,3);
    }
}