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
- 36368 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
What is a dequeue?
What is the height of binary tree?
What are the disadvantages of linear list?
Can sets contain duplicates?
Why is quicksort faster than merge sort?
How to find middle element of linked list in one pass?
State the different types of linked lists?
Why hashmap is faster than hashset?
What is the top of a stack?
What is unbounded queue?
What are the tasks performed during preorder traversal?
Write code for reversing a linked list.
Write a program to reverse a single linked list.
What is the space complexity of selection sort?
Are hash tables ordered?
