Consider the tree given below in this question. Suppose you have an array of letters where letter ‘A’ is on ‘0’ index and letter ‘Z’ is on ‘25’ index as shown in the given table.
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
Select a digit which is6, add 16 in it and then find the corresponding letter in the array of letters. For example, digit is6, then 6+16=22. Therefore, ‘W’ is the letter on 22th index in the array. Now write the complete trace of operations to search this letter (‘W’ in above case) by using
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here