in order:LOR pre order:OLR post order:LRO

How will inorder, preorder and postorder traversals print
the elements of a tree?

Question Posted / srinivas.bolusupati

Answer Posted / srinivas.bolusupati

in order:LOR
pre order:OLR
post order:LRO

Is This Answer Correct ?

18 Yes

3 No

Please Help Members By Posting Answers For Below Questions

Why do we use binary search?

918

What do you mean by the term “percolate up”?

953

Does hashset maintain order?

940

Define splay tree?

971

What are the types of array operations?

914

Can a tree be empty?

888

Explain how to find 3rd element from end in a linked list in one pass?

856

Can arraylist store objects?

954

What is return map?

965

What are b tree keys?

894

Define an algorithm. What are the types of algorithms?

1019

How hashmap increases its size?

1016

What is the default size of an arraylist?

936

What is the use of treemap?

951

What is minimum depth of binary tree?

972