How will inorder, preorder and postorder traversals print
the elements of a tree?
- 11 Answers
- 33797 Views
- I also Faced
- E-Mail Answers
Answer Posted / meenakshi
INORDER:: LNR
PREORDER:: NLR
POSTORDER::LRN
here L stands for the leftnode of the tree R stands for the
right node of the tree and N stands for the root node of
that tree.
| Is This Answer Correct ? | 10 Yes | 6 No |
Post New Answer View All Answers
How do you empty an arraylist?
What is a singletonlist?
What are binary trees?
How do you declare A pointer to array of three chars
What is the minimum number of queues that can be used to implement a priority queue?
What is the difference between Array and Arraylist?
Why do we use binary search?
Can treemap key null?
Which collection class is thread safe?
Is hashmap get thread safe?
What are the disadvantages of linked list over array?
how to delete first node from singly linked list?
What is a pass in bubble sort?
Can you use Bubble Sort To sort the number of elements.
How do you make a bubble chart with 3 variables?
