Interested to Buy Any Domain ? << Click Here >> for more details...
How will inorder, preorder and postorder traversals print
the elements of a tree?
- 11 Answers
- 36383 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
Is any implicit arguments are passed to a function when it is called?
How will you sort the elements of array in descending order?
Can hashmap be sorted?
Why use a tuple instead of a list?
Sorting is not possible by using which of the methods?
What is meant by heap sort?
Define non-linear data structures?
What do you mean by Logical Error
Explain the term tail recursion?
Why is data structure needed?
Why hashtable is faster than arraylist?
What is the minimum number of queues that can be used to implement a priority queue?
How does quicksort partition work?
write a code for Implementation of stack and queues.
Is arraylist fail fast?
