in order:lRr preorder:Rlr postorder:lrR l:left r:right R:root

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

Question Posted / sanjeevi

Answer Posted / sanjeevi

in order:lRr
preorder:Rlr
postorder:lrR
l:left
r:right
R:root

Is This Answer Correct ?

10 Yes

6 No

Please Help Members By Posting Answers For Below Questions

Is quicksort a stable sorting algorithm?

1000

Why using cookie to store session info is a better idea than just using session info in the request?

940

Describe the complexity of Quick Sort

937

Can arraylist contain duplicates?

857

What are the advantages of binary search over linear search?

1046

Define quadratic probing?

1033

You want to insert a new item in a binary search tree. How would you do it?

898

What do you mean by an Array?

953

Define the term “percolate up”?

957

What is bubble sort and quick sort?

953

Define non linear data structure.

976

What are the major data structures used in the rdbms?

1025

Explain the Stack

982

Is tuple immutable?

856

What are the advantages of linked list?

818