What is tree traversal and how we can do it?

1.	What is tree traversal and how we can do it?
Answer» This is a form of graph travelers and refers to a whole process of visiting each node in a tree DATA structure for check and update. The inorder traversals share nodes in nondecreasing order; the preorder traversals are USED to create a copy of the tree and GET prefix expression on of an expression tree, whereas the postorder traversal is required to delete a tree. Note: Our data structures and algorithms interview questions has been created by EXPERTS. It shall help you to answer some of the most asked questions during a job interview.

Answer»

This is a form of graph travelers and refers to a whole process of visiting each node in a tree DATA structure for check and update. The inorder traversals share nodes in nondecreasing order; the preorder traversals are USED to create a copy of the tree and GET prefix expression on of an expression tree, whereas the postorder traversal is required to delete a tree.

Note: Our data structures and algorithms interview questions has been created by EXPERTS. It shall help you to answer some of the most asked questions during a job interview.

Discussion

No Comment Found

Related InterviewSolutions

Please write basic algorithm for searching a binary search tree.
Whay do you mean by binary search tree?
What do you mean by binary trees?
What do you mean by linked list also explain its types?
What will be the postfix expression for (A + B) * (C - D)?
Explain the difference between PUSH and POP?
What do you mean by FIFO and LIFO?
What do you mean by Infix prefix and postfix notations?
What is Queue and how it is different from stack?
What is Stack and explain it's basic operations?