In a binary search tree (BST), which traversal order visits the keys in strictly ascending sorted order?
Answer and explanation
Correct answer: C. In-order traversal
- Step 1: A BST satisfies: left subtree root right subtree for every node.
- Step 2: In-order traversal visits: (1) Left subtree, (2) Root node, (3) Right subtree.
- Step 3: Because left values are smaller and right values are larger, in-order output is monotonically increasing.
Answer
In-order traversal.
Why not the others: 'Pre-order' visits root first (used for cloning trees); 'Post-order' visits root last (used for deleting trees); 'Level-order' is breadth-first search.
Practise more Python Programming, Data Structures, Algorithms, Networks and Cybersecurity.
Free questions with an explanation for every one, and full timed Saudi Secondary School Certificate mock tests.
More Python Programming, Data Structures, Algorithms, Networks and Cybersecurity questions
- What is the time complexity of searching for an element in an unsorted array of elements using linear search?
- What is the output of the following Python expression: `[x**2 for x in range(5) if x % 2 == 1]`?
- Which data structure operates on a Last-In, First-Out (LIFO) access principle?
- Which SQL clause is used to filter aggregated group records after a `GROUP BY` statement has been applied?
- What type of network topology connects all nodes to a central forwarding device such as a network switch?
- In cybersecurity, what type of malicious attack overwhelms a web server with massive volumes of traffic from multiple compromised sources to…