Register

Test by Bikram | Algorithms | Test 2 | Question: 18

• edited by
378 views
0 votes
0 votes

The following elements are inserted in sequence to create an AVL tree: $31, 36, 40, 19, 14, 24, 50$

What is the pre-order traversal of the created AVL tree?

  1. $36, 19, 14, 31, 24, 40, 50$
  2. $36, 14, 19, 31, 24, 40, 50$
  3. $31, 19, 14, 24, 40, 36, 50$
  4. $31, 19, 14, 24, 36, 40, 50$

 

• edited by
User Avatar

3 Answers

Best answer
2 votes
2 votes

WHERE AM I MISTAKES?

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Bikram asked May 26, 2017
486 views
Test by Bikram | Algorithms | Test 2 | Question: 30
The cost of optimal binary search tree for the identifier set $(a1, a2, a3) =$ (do, if, while) with $p(1) = 0.3, \ p(2) = 0.2, $ $p(3) = 0.15, q (0) = 0.05, q(1) = 0.15, q(2)= 0.1, q(3) = 0.05$ is: $1.65$ $1.95$ $1.8$ $2.1$
The cost of optimal binary search tree for the identifier set $(a1, a2, a3) =$ (do, if, while) with $p(1) = 0.3, \ p(2) = 0.2, $ $p(3) = 0.15, q (0) = 0.05, q(1) = 0.15...
User Avatar
2 votes
2 votes
2 answers
3
Bikram asked May 26, 2017
368 views
Test by Bikram | Algorithms | Test 2 | Question: 28
Assume Dijkstra's Algorithm is used to find the shortest paths from node G in the above graph. The total number of edges which are not included in any of the shortest paths from node G are _________.
Assume Dijkstra's Algorithm is used to find the shortest paths from node G in the above graph. The total number of edges which are not included in any of the shortest pat...
User Avatar
1 votes
1 votes
2 answers
4
Bikram asked May 26, 2017
486 views
Test by Bikram | Algorithms | Test 2 | Question: 27
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.
User Avatar
Link Copied!