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

Can hashmap be sorted?

919

When ArrayIndexOutOfBoundsException occurs?

1138

What is difference between arraylist and list?

933

What is hash data type?

951

What do you mean by external sorting?

871

What is the difference between collections class vs collections interface?

971

Is array size dynamic or fixed?

976

Explain Linked List

1013

Define b-tree of order m?

959

How do you initialize an arraylist?

981

What are the standard ways in which a graph can be traversed?

984

What is difference between hashmap and map?

1101

Which time complexity is best?

903

Define red-black trees.

964

What is the best case for bubble sort?

871