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

What is difference between hashmap and treemap?

914

Differentiate between failfast and failsafe.

1135

What is difference between linear and non linear data structure?

1112

Is file a data structure?

926

How can a binary tree be represented using the rotation?

885

Why is reflection slower?

878

What is sort in data structure?

836

What is non linear structure?

980

How to use appendNode() in linkedlist()?

1053

Tell me the difference between the character array and a string.

911

What is the method to find the complexity of an algorithm?

1069

Is array a collection?

874

What package is arraylist?

995

What are the different types of data structures explain briefly?

1015

How do signed and unsigned numbers affect memory?

852