Last Updated：2025/11/23

(computing theory) Of a tree traversal, recursively visiting the root in between the left and right subtrees.

音声機能が動作しない場合はこちらをご確認ください

See correct answer

inorder

Source Word

inorder

not-comparable

(computing theory) Of a tree traversal, recursively visiting the root in between the left and right subtrees.

Japanese Meaning

（計算理論）木構造の走査方法の一つで、左の部分木を訪問した後、根を訪れ、続いて右の部分木を再帰的に訪問する方法（中間順走査）

The inorder traversal algorithm visits the root between its left and right subtrees.

中間順走査アルゴリズムは、左部分木と右部分木の間で根ノードを訪問します。

Sense（1）

(computing theory) Of a tree traversal, recursively visiting the root in between the left and right subtrees.