This question was previously asked in

NIELIT Scientific Assistant A Official Paper 2020

- Heap tree
- Almost complete binary tree
- Binary search tree
- Cannot be determined

Option 3 : Binary search tree

Free

ST 1: General Awareness

6919

15 Questions
15 Marks
15 Mins

**Opttion 3**: correct:

When we perform in order traversal on a binary tree, we get the ascending order array. The tree is **binary search tree**

__Random binary search tree__

Post-order traversal is 23, 18, 27, 25, 10, 60, 80, 70, 30.

In-order traversal traversal is 10, 18, 23, 25, 27, 30, 60, 70, 80

Preorder traversal is 30, 10, 25, 18, 23, 27, 70, 60 ,80

In order traversal, of the binary search tree is in ascending order.

India’s **#1 Learning** Platform

Start Complete Exam Preparation

Daily Live MasterClasses

Practice Question Bank

Mock Tests & Quizzes

Trusted by 2,16,36,918+ Students

Testbook Edu Solutions Pvt. Ltd.

1st & 2nd Floor, Zion Building,

Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

[email protected]
Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

Toll Free:1800 833 0800

Office Hours: 10 AM to 7 PM (all 7 days)