Algorithms and Data Structures Flashcards
1
Q
BST: How is Breadth First Traversal implemented?
A
With a queue.
2
Q
BST: How is Depth First Traversal implemented?
A
With recursion.
3
Q
What is pre-order traversal?
A
A form of Depth First Search of a BST.
Order is:
parent - left - right
4
Q
What is in-order traversal?
A
A form of Depth First Search of a BST.
Order is:
left - parent - right
5
Q
What is post-order traversal?
A
A form of Depth First Search of a BST.
Order is:
left - right -parent