使用队列LinkedBlockingQueue，以广度优先方式从本结点遍历整个ViewTree所有结点

    private fun readViewTree() {
        val queue = LinkedBlockingQueue<ViewGroup>()
        var viewTopRoot = binding.root.getParentView()
        while (viewTopRoot.parent != null && viewTopRoot.parent is ViewGroup) {
            viewTopRoot = viewTopRoot.getParentView()
        }
        var layerIndex = 1
        queue.add(viewTopRoot)
        while (queue.isNotEmpty()) {
            val viewGroup = queue.poll()
            layerIndex--
            viewGroup?.children?.forEach {
                if (it is ViewGroup) {
                    queue.add(it)
                    layerIndex++
                }
                Log.i("cjztest", it.toSimpleNameString())
            }
        }
    }