How will inorder, preorder and postorder traversals print
the elements of a tree?
- 11 Answers
- 33766 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
What is the use of placement new?
How does selection sort work?
Which is faster hashset or treeset?
What is arraylist load factor?
What are vectors used for in real life?
Explain what are the methods available in storing sequential files ?
What is internal and external sorting?
What is ascending and descending order?
How can we delete any specific node from the linked list?
What is linear-logarithm chasm?
Write the importance of hashing?
which is the simplest file structure? (Sequential, indexed, random)
What do you mean by data types?
Which sorting algorithm is considered the fastest?
What are the different types of hash functions?
