How will inorder, preorder and postorder traversals print
the elements of a tree?
- 11 Answers
- 33763 Views
- I also Faced
- E-Mail Answers
Answer Posted / srinivas.bolusupati
in order:LOR
pre order:OLR
post order:LRO
| Is This Answer Correct ? | 18 Yes | 3 No |
Post New Answer View All Answers
How does hashset maintain order?
What are linked list?
What is complexity algorithm?
What is sorting with example?
how to insert a new node in linked list where free node will be available?
Define binary tree insertion.
Which interface treemap implements?
Are data structures important?
What are different methods of collision resolution in hashing.
Define an abstract data type (adt)?
What is the minimum number of nodes that a binary tree can have?
Is arraylist a collection?
What is concurrentlinkeddeque?
In tree construction which is the suitable efficient data structure?
What are arrays used for?
