How will inorder, preorder and postorder traversals print
the elements of a tree?
- 11 Answers
- 33776 Views
- I also Faced
- E-Mail Answers
Answer Posted / meenakshi
INORDER:: LNR
PREORDER:: NLR
POSTORDER::LRN
here L stands for the leftnode of the tree R stands for the
right node of the tree and N stands for the root node of
that tree.
| Is This Answer Correct ? | 10 Yes | 6 No |
Post New Answer View All Answers
Which is better hashmap or hashtable?
How do you do a mergesort?
Why do we need sorting?
Difference between abstract data type, data type and data structure?
There are 2 int type array data type. One is containing 50 elements, and another one is containing 30 elements. Can we assign the array of 50 elements to an array of 30 elements?
Define collision in hashing?
What is binary tree used for?
What is the meaning of anonymous array? Explain with an example?
Parenthesis is never required in postfix or prefix expressions, why?
what is Singly Linked list?
What is difference between array and string?
Discuss how to implement queue using stack.
What is difference between arraylist and linkedlist?
What is the difference between arrays sort and collections sort?
How many types of searching are there in data structure?
