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

"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 can be termed as Pre-order traversal.  

Other types of the traversal are in order traversal and post order.traversal.

Pre-order traversal is mostly used to create the copy of the tree."