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
- 36462 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
Will it create any problem if we add elements with key as user defined object into the treemap?
Is binary tree a bst?
Is array size dynamic or fixed?
Explain binary representation?
What is the use of substring?
How dynamic arrays are created?
Why is map not a collection?
Give a basic algorithm for searching a binary search tree?
What data type is enum?
How will you reverse Linked List.
What is the difference between hashmap and treemap?
What are the tasks performed during postorder traversal?
What is difference between an Array and ArrayList?
Why do we need arrays if all the operations that are performed on arrays can be performed on arraylist?
What are the disadvantages of circular list?
