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

How is any data structure application is classified among files?

1111

What is thread and types of thread?

1005

Can arraylist contain duplicates?

918

What are the different types of data structures explain briefly?

1153

When would you use a hashmap?

1014

What are the types of bulleted list?

897

What is data structure and why we need them?

941

Which type of sorting is best?

984

What do you understand by doubly linked list?

987

If you are using c language to implement the heterogeneous linked list, explain what pointer type will you use?

1042

What is the complexity of arrays sort?

975

What is the purpose of sorting?

977

What are different types of sorting techniques?

992

Give the example of validating the parenthesis of expression using stack.

1095

What is difference between data type and data structure?

869