depth traversal
深度遍歷
breadth traversal
廣度遍歷
in-order traversal
中序遍歷
pre-order traversal
前序遍歷
post-order traversal
後序遍歷
level traversal
層次遍歷
tree traversal
樹遍歷
graph traversal
圖遍歷
traversal order
遍歷順序
traversal method
遍歷方法
the algorithm performs a depth-first traversal of the tree.
該算法對樹進行深度優先遍歷。
traversal of the network was necessary to identify the bottlenecks.
遍歷網絡是識別瓶頸所必需的。
we need to optimize the traversal of the data structure.
我們需要優化數據結構的遍歷。
the traversal of the graph can be done using various methods.
圖的遍歷可以使用多種方法進行。
inorder traversal yields the nodes in a sorted order.
中序遍歷會以排序的順序返回節點。
traversal techniques are essential for data processing.
遍歷技術對數據處理至關重要。
we implemented a traversal function for the linked list.
我們爲鏈表實現了一個遍歷函數。
understanding tree traversal is crucial for algorithm design.
理解樹的遍歷對算法設計至關重要。
the traversal path can be visualized for better understanding.
可以可視化遍歷路徑以便更好地理解。
efficient traversal can significantly improve performance.
高效的遍歷可以顯著提高性能。
depth traversal
深度遍歷
breadth traversal
廣度遍歷
in-order traversal
中序遍歷
pre-order traversal
前序遍歷
post-order traversal
後序遍歷
level traversal
層次遍歷
tree traversal
樹遍歷
graph traversal
圖遍歷
traversal order
遍歷順序
traversal method
遍歷方法
the algorithm performs a depth-first traversal of the tree.
該算法對樹進行深度優先遍歷。
traversal of the network was necessary to identify the bottlenecks.
遍歷網絡是識別瓶頸所必需的。
we need to optimize the traversal of the data structure.
我們需要優化數據結構的遍歷。
the traversal of the graph can be done using various methods.
圖的遍歷可以使用多種方法進行。
inorder traversal yields the nodes in a sorted order.
中序遍歷會以排序的順序返回節點。
traversal techniques are essential for data processing.
遍歷技術對數據處理至關重要。
we implemented a traversal function for the linked list.
我們爲鏈表實現了一個遍歷函數。
understanding tree traversal is crucial for algorithm design.
理解樹的遍歷對算法設計至關重要。
the traversal path can be visualized for better understanding.
可以可視化遍歷路徑以便更好地理解。
efficient traversal can significantly improve performance.
高效的遍歷可以顯著提高性能。
探索常見搜尋詞彙