How will inorder, preorder and postorder traversals print
the elements of a tree?
- 11 Answers
- 33829 Views
- I also Faced
- E-Mail Answers
Answer Posted / sankar
in order:LOR
pre order:OLR
post order:LRO
L=LEFT CHILD
R=RIGHT CHILD
O=ROOT NODE
| Is This Answer Correct ? | 15 Yes | 6 No |
Post New Answer View All Answers
What is placement new in data structures?
Where will be the free node available while inserting a new node in a linked list?
What thread means?
Write a program for Sorting an Array. Which sorting will you prefer?
What is sorting in data structure?
What are the properties of binary tree?
What are vectors used for in real life?
Mention for which header list, you will found the last node contains the null pointer?
What is the difference between list and arraylist?
Why is hashset not ordered?
How do you sort an arraylist?
What is the difference between arraylist and linkedlist?
What is the family trees and connection by clause?
what is a balanced tree.
Is quicksort a stable sorting algorithm?
