in order:LOR pre order:OLR post order:LRO L=LEFT CHILD R=RIGHT CHILD O

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

Question Posted / sankar

Answer Posted / sankar

in order:LOR
pre order:OLR
post order:LRO
L=LEFT CHILD
R=RIGHT CHILD
O=ROOT NODE

Is This Answer Correct ?

15 Yes

6 No

Please Help Members By Posting Answers For Below Questions

Why quicksort is faster than merge sort?

856

Define heap order property?

949

If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?

913

How to find the missing element in integer array of 1 to 7?

898

What sorting algorithm should be used for sorting strings?

896

Is quicksort a stable sorting algorithm?

937

State the difference between stacks and linked lists?

923

What is the best case for bubble sort?

806

Which is better merge or quick sort?

897

What is stack in geography?

812

Give us a program to reverse a linked list.

927

What is the space complexity of quicksort?

865

Which sorting is used in collections sort?

824

What is the height of an empty tree?

905

How to find the duplicate in an array?

908