godot多叉树遍历
Tree traversal - Wikipedia Tree Traversals (Inorder, Preorder and Postorder) - GeeksforGeeks 遍历多叉树 - 简书 (jianshu.com) 广度优先 缺陷--pop_front()在大型数组中执行较慢 func traverse_breath_order(): var deque = [] var node = self deque.append(node) while deque.size() > 0: node = deque.pop_front() print(node.text) deque.append_array(node.get_children()) 输出结果 root A B A1 A2 A3 B1 B2 A11 A31 A32 深度优先 #数组遍历深度逆序 func traverse_preorder_inversed(): var deque = [] var node = self deque.append(node) while deque.size() > 0: node = deque.pop_back() print(node.text) deque.append_array(node.get_children()) 输出结果 root B B2 B1 A A3 A32 A31 A2 A1 A11 #递归遍历深度 func recurse_preorder(node): print(node.text) for i in node.get_children(): recurse_preorder(i) 输出结果 root B B2 B1 A A3 A32 A31 A2 A1 A11 #数组遍历深度 func traverse_preorder(): var deque = [] var node = self deque.append(node) while deque.size() > 0: node = deque.pop_back() print(node.text) var m = node.get_...
