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 data type explain?

1058

Why is hashing used?

822

Why do we need searching algorithms?

1029

List the basic operations carried out in a linked list?

1002

Is boolean a data type?

914

Differentiate linear from non linear data structure?

935

List out the basic operations that can be performed on a stack?

861

What is the need for path compression?

1040

How many sorting algorithms are there?

960

Can array store heterogeneous data?

797

Differentiate between iterator and listiterator.

966

Is array size dynamic or fixed?

918

List the data structures which are used in hierarchical data model.

910

Is heap sort stable?

843

What is bubble sort and quick sort?

913