If a Tree ADT is implemented using an array A where any node v is stored at A$[$rank$($v$)]$ such that the root of the tree is placed in the second element of the array, rank$($root$)=1.$

If the node N is placed in the array element of the index $100,($rank$($N$)=100,$ the rank of the left child of the node N will be: $101,$ true or false