Traverse the given tree using Inorder, Preorder and Postorder traversals.

Inorder : D H B E A F C I G J

Preorder: A B D H E C F G I J

Postorder: H D E B F I J G C A


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Data Structures Interview Questions

Define the term “percolate up”?

0 Answers  


Why we use linked list?

0 Answers  


What is linear and non linear structure?

0 Answers  


Is map a data structure?

0 Answers  


How does the size of arraylist increases dynamically?

0 Answers  






Is json a data structure?

0 Answers  


Describe the degree term in a tree.

0 Answers  


Are linked lists considered linear or non-linear data structure?

0 Answers  


Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.

0 Answers   TCS,


List the data structures which are used in hierarchical data model.

0 Answers  


What is data and its type?

0 Answers  


What is the space complexity of selection sort?

0 Answers  


Categories