How will inorder, preorder and postorder traversals print
the elements of a tree?
- 11 Answers
- 33772 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
What do you mean by Runtime Error
Define indegree of a graph?
Is bucket sort stable?
How do you empty an arraylist?
What are binary search and fibonacci search?
Differentiate between arraylist and linkedlist.
How to compare Two Arrays?
Define a queue?
What are examples of data structures?
What is meant by binary tree?
What is a vector element?
Why do we use hashset?
Which is better arraylist or linkedlist?
Can the double-checked locking fail on a single processor system?
What is weight balanced tree in data structure?
