// Update is called once per frame void Update() { if (treeFrontNode != null) { //根节点遍历即可,子节点会被递归遍历 treeFrontNode.tick(); } }