How will inorder, preorder and postorder traversals print
the elements of a tree?
- 11 Answers
- 33815 Views
- I also Faced
- E-Mail Answers
Answer Posted / sanjeevi
in order:lRr
preorder:Rlr
postorder:lrR
l:left
r:right
R:root
| Is This Answer Correct ? | 10 Yes | 6 No |
Post New Answer View All Answers
Can you store different types in an array?
Is array a linked list?
Which interfaces are implemented by linkedlist?
What is mean by merge sort?
Define a relation?
What is the difference between null and void?
What is a treeset?
State the difference between arrays and linked lists?
Write the stack overflow condition.
What are different sorting algorithms?
What are different techniques for making hash function? Explain with example.
Why sorting is done?
Tell me do array subscripts always start with zero?
Explain what is B-tree?
Differentiate between priorityqueue and treeset.
