edited by
2,074 views

3 Answers

3 votes
3 votes
$\underline{\textbf{Answer:}\Rightarrow}\;\;\mathbf{c.}$

For finding inorder successor we just need to do the inorder traversal of the given tree.

The element which will come before the given element is called predecessor and the element which will come afterwards is called the successor.

Inorder traversal will be: $\mathbf{2\;3\;4\;6\;7\;9\;13\;\underline{15}\;\enclose{circle}{17}\;18\;20}$
edited by
0 votes
0 votes

Inorder successor of a node is a minimum element in right subtree of that node. Here $15's$ right subtree having $17$  as minimum element which is a inorder successor of $15$.

Morever if we write inorder of the given tree: 

 2, 3, 4, 6, 7, 9, 13, 15, 17, 18, 20  element after 15 is inorder successor

Option c) is correct

0 votes
0 votes

You just need to do the inorder traversal i.e., just sort the elements 

 

2  3  4  6  7  9  13  15  17  18  20. 

After 15 17 is coming so answer is c)17

Answer:

Related questions

2 votes
2 votes
3 answers
1
6 votes
6 votes
3 answers
2
Satbir asked Jan 13, 2020
3,248 views
Of the following, which best approximates the ratio of the number of nonterminal nodes in the total number of nodes in a complete $K$-ary tree of depth $N$ ?$1/N$$N-1/N$$...
4 votes
4 votes
3 answers
3
Satbir asked Jan 13, 2020
2,872 views
Convert the pre-fix expression to in-fix $- ^{\ast} +ABC^{\ast} – DE+FG$$(A-B)^{\ast}C+(D^{\ast}E)-(F+G)$$(A+B)^{\ast}C-(D-E)^{\ast}(F+G)$$(A+B-C)^{\ast}(D-E)^{\ast}(F+...
5 votes
5 votes
3 answers
4
Satbir asked Jan 13, 2020
5,713 views
The minimum height of an AVL tree with $n$ nodes is$\text{Ceil } (\log_2(n+1))$$1.44\ \log_2n$$\text{Floor } (\log_2(n+1))$$1.64\ \log_2n$