Question

If l is the left node, m is the middle node and r is the right node of a binary tree, then an l-m-r traversal can be termed as:

Answer 1

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

The two other types of traversal in a binary tree are m-l-r traversal for pre order and l-r-m traversal for post order.

These are examples of tree traversals in binary search trees.

Answer 2

If l is the left node, m is the middle node and r

is the right node of a binary tree, then an l-m-r

traversal can be termed as In Order.

The two other types of traversal in a binary tree

are m-l-r traversal for pre order and l-r-m traversal

for post order.

These are examples of tree traversals in binary

search trees.