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
- 0 Answers
- 645 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
More Data Structures Interview Questions
Explain Linked List
Does mentioning the array name gives the base address in all the contexts?
What sort does arrays sort use?
Explain the common uses of tree database.
Explain the uses of b+ tree.
Is linkedlist thread safe?
Define dynamic data structures?
What is stable sort example?
What is the use of data structure in real life?
What is bubble sort used for?
Can we make hashmap synchronized?
What is the family trees and connection by clause?
Windows 
