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

What is difference between arraylist and linkedlist?

1042

What is meant by hashing?

853

what is Linked lists?

983

Which is the simplest file structure?

1006

Is an arraylist a vector?

970

What do you mean by selection sort?

882

Why insertion is faster in linked list?

837

What is time complexity of binary search?

898

How to check array contains value or not?

947

What are the disadvantages of linear list?

913

What does stack top do?

905

What is a list in data structure?

951

Write a program to reverse a single linked list.

950

What are all the classes and interfaces that are available in the collections?

855

What is frozenset?

907