最終更新日：2024/07/29
(computing theory, of a traversal of a tree) Such that, recursively, the root is visited before the left and right subtrees.
正解を見る
preorder
編集履歴（0）
(computing theory, of a traversal of a tree) Such that, recursively, the root is visited before the left and right subtrees.
preorder
DiQt（ディクト）
無料
★★★★★★★★★★
