bars
演算法與資料結構
search
circle-xmark
⌘
Ctrl
k
copy
Copy
chevron-down
分類題型
chevron-right
Tree 樹
Postorder 後序遍歷
後序遍歷的意義是先進入到左子樹、右子樹,再將根節點的資訊處理完。
Previous
426. Convert Binary Search Tree to Sorted Doubly Linked List
chevron-left
Next
106. Construct Binary Tree from Inorder and Postorder Traversal
chevron-right
Last updated
4 years ago