Latest DATA STRUCTURE Aptitude Question SOLUTION: Which of the following traversal is used for printing the keys of Binary search tree in ascending order? [1]post-order traversal [2]pre-order traversal [3]in-order traversal [4]Non

• Placement Papers
• /
• DATA STRUCTURE
• /
• Programming
• /
• Basics

DATA STRUCTURE Question Papers:

(#M40155911) DATA STRUCTURE Programming question Binary search tree Keep an EYE

Which of the following traversal is used for printing the keys of Binary search tree in ascending order?
[1]post-order traversal
[2]pre-order traversal
[3]in-order traversal
[4]None of the above

Asked In DATA STRUCTURE Rishikesh Agrawani (8 years ago)

Unsolved Read Solution (7)

Is this Puzzle helpful?   (9)   (1) Submit Your Solution Basics

Read Solution (7) :

keshav  (8 years ago)

in-order traversal
in the in-order traversal we start from the leftmost leaf-node so in this way we will get element in ascending order

Is this solution Helpfull? Yes (5) | No   

Umesh Mathapati  (7 years ago)

To get in ascending order you need to traverse in "IN-ORDER"


"PRE ORDER Traversal " is Clockwise traversal i.e., Parent Node, Left Node and Right Node.
"POST ORDER Traversal " is Anti-Clockwise traversal i.e., Left Node ,Right Node and Parent Node.
"IN-ORDER Traversal " is like "A" i.e., Left Node ,Parent Node and Right Node.

Is this solution Helpfull? Yes (4) | No   

Nikhil  (8 years ago)

[3]in-order traversal

Is this solution Helpfull? Yes (2) | No   

manaswini tripathy  (8 years ago)

3.in-order traversal
left-root-right...according to this the keys of BST are in ascending order

Is this solution Helpfull? Yes (1) | No   

Shaunak  (6 years ago)

In-order Traversal. Left, Root, Right

Is this solution Helpfull? Yes | No   

Divya Batra  (6 years ago)

in order traversal is used to write keys in ascending order.

Is this solution Helpfull? Yes | No   

Anand Kumar  (5 years ago)

in-order, since in in-order traversal we display first left child then root and after that right child and a/c to def of binary search tree the left child is smaller then root and the right child is greater than root so in-order will give us ascending order

Is this solution Helpfull? Yes | No   

Please Login to Read Solution.