题目:给定一个二叉树,返回其按层次遍历的节点值。 (即逐层地,从左到右访问所有节点)。例如:给定二叉树: [3,9,20,null,null,15,7],3/ 9 20/ 15 7返回其层次遍历结果:[[3],[9,20],[15,7]]/** * Definition for a binary tree node. * public class TreeN...
using System.Collections;using System.Collections.Generic;using UnityEngine;using UnityEngine.UI;public class DisplayInfo : MonoBehaviour{ public GameObject displayImage; public Text objectNameText; public LayerMask mask; private voi