How will inorder, preorder and postorder traversals print
the elements of a tree?
- 11 Answers
- 33777 Views
- I also Faced
- E-Mail Answers
Answer Posted / kayalvizhi jayavel
Inorder: Left, Node, Right
Preorder: Node, Left, Right
Postorder: Left, Right, Node
| Is This Answer Correct ? | 30 Yes | 7 No |
Post New Answer View All Answers
Compare Queue and Topic ?
What's difference between stack and queue?
What is adt in data structure with example?
What are the tasks performed while traversing a binary tree?
What do you mean by Syntax Error
What sorting algorithm should be used for sorting strings?
Is quicksort recursive?
What is time complexity of sorting algorithms?
How can you insert a node in a random location of the linked list?
What is the use of bubble sort?
Define a stack?
What is doubly linked list?
Write a program to insert an element and in the specific position in the array?
Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?
Is set sorted?
