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
- 37225 Views
- I also Faced
- E-Mail Answers
Answer Posted / vidhun s
in order:LOR
pre order:OLR
post order:LRO
L=LEFT CHILD
R=RIGHT CHILD
O=ROOT NODE
| Is This Answer Correct ? | 34 Yes | 5 No |
Post New Answer View All Answers
What is array simple?
How would you reverse characters of an array without using indexing in the array.
Are duplicates allowed in hashmap?
Which is best book for data structures?
Define non-terminal nodes in a tree?
Define a set?
What is bubble sort technique?
How do you replace an element in an arraylist?
Define primary clustering?
Why hashmap is faster than hashtable?
What are the difference between malloc() and calloc()?
How do you separate zeros from non-zeros in an array?
What should be done in the base case for this recursive problem?
Define back edge?
Explain the Stack
