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
- 36857 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
What is a bubble sort and how do you perform it?
What do you mean by balance factor of a node in avl tree?
What is structure of data type?
Given an unsorted linked list, and without using a temporary buffer, write a method that will delete any duplicates from the linked list?
Why do we need linked list?
What does a bubble chart show?
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
What is height balanced tree?
What are red-black trees?
What is the use of heap sort?
Which searching algorithm is best?
What is numeric array?
What is the difference between file structure and storage structure?
Write a Program for Insert in a sorted list
Is quicksort faster than merge sort?
