How will inorder, preorder and postorder traversals print
the elements of a tree?
- 11 Answers
- 33796 Views
- I also Faced
- E-Mail Answers
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
Describe tree database. Explain its common uses.
Write a program using mergesort technique.
What is difference between array and arraylist?
What is doubly linked list?
Will it create any problem if we add elements with key as user defined object into the treemap?
Write the recursive c function to count the number of nodes present in a binary tree.
What thread means?
What is thread and types of thread?
For addition and deletion. Which one is most preferred: array list or linked list?
What are the properties of binary heap?
Is treeset sorted?
What do you mean by selection sort?
Will hashmap allow null keys?
Which interfaces are implemented by linkedlist?
What sorting algorithm does arrays sort use?
