There are different ways of traversing a binary tree. What are those t – McqOptions

MCQOPTIONS

1.	There are different ways of traversing a binary tree. What are those traversing technique?
A.	Prefix, infix, postfix
B.	Pre-order, in-order, post-order
C.	Pre-traversal, in-traversal, post-traversal
D.	None of the above.
Answer» C. Pre-traversal, in-traversal, post-traversal

Discussion

No Comment Found

Related MCQs

If a binary tree of depth is d , then when can we say that it is an almost complete binary tree?
If ' h ' is a hashing function and it is used to hash ' n ' keys into a table of size ' m 'where n
What time is required for deleting a node ' x ' from a Doubly Linked List whose having ' n ' nodes?
What is the postfix form of the following prefix expression? A / B * C $ DE
Which of the following is the depth of a Complete Binary Tree?
Which of the following sorting methods would be most suitable for sorting a list?
In graphs, A hyperedge is an edge that is allowed to take on any number of _____________.
A Vertex comprising only incoming edges without any outgoing edges, specifically known as _________.
Which graph consists of an unordered pair of vertices representing the similar edge? (Data Structure)
A path in which all the vertices are distinct excluding the initial and final vertices is known as _________. (Data Structure)