Inorder: Left, Node, Right Preorder: Node, Left, Right Postorder: Left, R

How will inorder, preorder and postorder traversals print
the elements of a tree?

Question Posted / kayalvizhi jayavel

Answer Posted / kayalvizhi jayavel

Inorder: Left, Node, Right
Preorder: Node, Left, Right
Postorder: Left, Right, Node

Is This Answer Correct ?

30 Yes

7 No

Please Help Members By Posting Answers For Below Questions

How many types of linked list are there?

926

What is difference between list and array list?

891

What is data structure and its operations?

897

What is the difference between list and arraylist?

998

What is a sorting algorithm in data structure?

970

Define the queue data structure.

1125

Why is an array homogeneous?

918

What are red-black trees?

1084

State the merits of linear representation of binary trees?

1071

Define forest?

1034

How many types of priority queue are there?

966

How arraylist increase its size?

950

What is peek in stack?

1000

Does treemap allow null values?

916

What are the different types of collections?

1027