Question

if L is the left node, M is the root node and R is the right node of a binary tree then an L-M-R traversal ca n be termed as :

Answer 1

the right node of a binary tree, then an l-m-r traversal can be termed as In Order.