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
- 36396 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
How many types of data structures are used?
Is bubble sort faster than selection sort?
What happens if we put duplicate key in hashmap?
What are different methods of collision resolution in hashing.
What is hash value of a string?
On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.
What is the best time complexity of bubble sort?
How do you replace an element in an arraylist?
Describe tree database.
What do you mean by balance factor of a node in avl tree?
What is the difference between null and void pointer in data structures?
Who created quicksort?
What do you mean by the term “percolate up”?
What are the applications of priority queues?
Can you change size of array once created?
