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
- 36839 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
What is the maximum size of array?
What is the time complexity of arrays sort?
Is array immutable?
What are scalar values?
What is the difference between ienumerable and list?
Which method will arrange the element of an array in alphabetical order?
What is mean by sorting?
Does stringutils isempty check for null?
List the types of rotations available in splay tree?
What is a linear search?
How would you use bsearch() function to search a name stored in array of pointers to string?
How would you check if a binary tree is BST or not ? Write a program.
What is a postfix expression?
What is binary tree used for?
Define 2-3 tree?
