INORDER:: LNR PREORDER:: NLR POSTORDER::LRN here L stands for the leftn

How will inorder, preorder and postorder traversals print
the elements of a tree?

Question Posted / meenakshi

11 Answers
37222 Views
I also Faced
E-Mail Answers

Answer Posted / meenakshi

INORDER:: LNR
PREORDER:: NLR
POSTORDER::LRN
here L stands for the leftnode of the tree R stands for the
right node of the tree and N stands for the root node of
that tree.

Is This Answer Correct ?

10 Yes

6 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

Explain binary search tree?

1000

what is a balanced tree.

1050

What is an object array?

995

What are the advantages of linked list?

871

What is a matrix?

1179

Run time memory allocation is known as ?

1051

What is 1d array?

1032

What is heap and its types?

1044

Describe stack operation.

1019

What is the difference between push and pop?

1157

Which sorting method is slowest?

1004

Why is it important to sort waste?

1032

Is radix sort faster than quicksort?

917

How do I sort a hashmap key?

928

Describe the complexity of Quick Sort

993