308 views

2 Answers

2 2 votes
Option A :

  tree :  in preordr : 100 , 41 ,59,17,24,26,33,11,15

 
Position:
Show:

Related questions

1 1 vote
2 2 answers
447
447 views
GO Classes asked Sep 11, 2025
447 views
G is an undirected graph with vertex set ( $\mathrm{v} 1, \mathrm{v} 2, \mathrm{v3}, \mathrm{v4}, \mathrm{v5}, \mathrm{v6}, \mathrm{v7}$ ) and edge set [ $\mathrm{v} 1 \m...
1 1 vote
4 4 answers
468
468 views
GO Classes asked Sep 11, 2025
468 views
Arrange the following recurrence relations in increasing order of their time capacity.(A) $\mathrm{T}(\mathrm{n})=\mathrm{T}(\mathrm{n} / 2)+1$(B) $\mathrm{T}(\mathrm{n})...
2 2 votes
3 3 answers
505
505 views
GO Classes asked Sep 11, 2025
505 views
Which of the following is not time complexity of the following code:(O represents big-oh) for (i=1 to n): // Some constant time operation,O(1) // Then a loop that runs lo...
2 2 votes
2 2 answers
430
430 views
GO Classes asked Sep 11, 2025
430 views
If the array $A$ contains elements $25,40,23,7,54,78$ and $2$ in that order, The element at $3^{\text {rd }}$ position of the array after $3^{\text {rd }}$ pass of insert...