Bissoy.com
Doctors Medicines MCQs Q&A

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

When we perform in order traversal on a binary tree, we get the ascending order array. The tree is: Correct Answer Binary search tree

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

[ alt="5faad4d3b638c5df89d4ecdb 26 Nov 2020 Shashi D1" src="//storage.googleapis.com/tb-img/production/20/11/5faad4d3b638c5df89d4ecdb_26_Nov_2020_Shashi_D1.PNG" style="width: 136px; height: 172px;">

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.

Related Questions

Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is _________
Which of the following is/are correct about a strictly binary tree? A. A binary tree is called strictly binary tree if every non-­leaf node of it has non empty left and right sub tree B. In strictly binary tree can have two children or no child C. A strictly binary tree with n leaves always contact 2n­-1 nodes
A teacher asked the class to subtract 5 from 75.70% of the class said: 25. Their work was shown as: \(\begin{array}{*{20}{c}} {\begin{array}{*{20}{c}} 7&5 \end{array}}\\ {\underline {\begin{array}{*{20}{c}}\ { - 5} \ \ \ &{} \end{array}} }\\ {\underline {\begin{array}{*{20}{c}} 2&5 \end{array}} } \end{array}\) Which of the following describes the most appropriate remedial action that the teacher should take to clarify this misconception?
The median for an odd number of observations is _________ where n is the number of observations. rank on the ascending order of observations b) rank on the ascending order of observations c) Average of and (n/2) rank on the ascending order of observations d) (n/2) rank on the ascending order of observations
We create a binary search tree B1 by inserting the numbers 1, 2, 3, 4, 5 into an empty binary search tree. We create another binary search tree B2 by inserting the numbers into an empty binary search tree in the reverse order. What is the difference between the right-most element of B1 and the left-most element of B2?
Six students of a school – Radha, Raj, Rahul, Mira, Aarav and Arijit are selected from different classes – 7th, 8th, 9th, 10th, 11th and 12th standards (not necessarily in the same order) to perform individually in the school annual function. Their order of performances is decided as per their classes. The one who is in 12th class will perform first, then after that 11th class student will perform and so on. Mira will perform immediate after the Rahul but before Arijit. Mira does not study in 8th class. Raj will perform immediate after Aarav but Raj neither studies in 8th class nor in 7th class. Who will perform last in the school annual function?
The pre-order traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19. Which one of the following is the post order traversal of the tree?
Postorder traversal of a given binary search tree T produces following sequence of keys: 3, 5, 7, 9, 4, 17, 16, 20, 18, 15, 14 Which one of the following sequences of keys can be the result of an in-order traversal of the tree T?
Consider a full binary tree with n internal nodes, internal path length i, and external path length e. The internal path length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the external path length is the sum, taken over all leaves of the tree, of the depth of each leaf. Which of the following is correct for the full binary tree?
The preorder traversal sequence of a binary search tree is 25, 15, 10, 4, 12, 22, 18, 24, 50, 35, 31, 44, 70, 66, 90 Which one of the following is the postorder traversal sequence of the same tree?