How will inorder, preorder and postorder traversals print
the elements of a tree?
Answer Posted / vidhun s
in order:LOR
pre order:OLR
post order:LRO
L=LEFT CHILD
R=RIGHT CHILD
O=ROOT NODE
| Is This Answer Correct ? | 34 Yes | 5 No |
Post New Answer View All Answers
How do you find the number of comparisons in bubble sort?
Devise a program to sort an array using bubble sort.
What is a hashset?
What do you mean by Logical Error
What does simulation of queues mean?
How to create your own data structure in java?
Can we make hashmap synchronized?
How to get top two numbers from an array?
What you mean by sorting?
Are the expressions arr and &arr same for an array of integers?
What is a Breadth First Search? Give a few of its applications.
Is hashmap faster than arraylist?
How do you declare An array of three char pointers
What is scalar example?
Can arraylist hold duplicates?