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 / vidhun s

Answer Posted / vidhun s

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

Is This Answer Correct ?

34 Yes

5 No

Please Help Members By Posting Answers For Below Questions

In Data Structure, write output of given program.

862

What is meant by ordered and sorted in collections?

846

What is a string or array type?

766

Which searching algorithm is best?

838

Describe the degree term in a tree.

902

What does a bubble chart show?

843

What do you mean by double hashing?

1002

Define adjacent nodes?

966

What is the difference between a push and a pop?

915

Explain the term run-time stack?

940

What is the difference between collections class vs collections interface?

909

Is array immutable?

851

If I try to add enum constants to a treeset, what sorting order will it use?

1103

Are collections thread safe?

790

How do you sort in ascending order in arraylist?

827