bars
演算法與資料結構
search
circle-xmark
Ctrl
k
copy
Copy
chevron-down
分類題型
chevron-right
Tree 樹
Preorder 前序遍歷
前序遍歷的意義是先將根節點的資訊處理完,再分別進入到左子樹、右子樹。
Previous
1135. Connecting Cities With Minimum Cost
chevron-left
Next
105. Construct Binary Tree from Preorder and Inorder Traversal
chevron-right
Last updated
3 years ago