设对一个n个结点的完全二叉树按序的编号为1，2，3…n，若某结点I≤(n-1)/2，则结点 I的右子女为( )。

A．2i-1

B．2i

C．2i+1

D．I+1

—Would you like to have some milk ?        

—__________        [     ]

A.Very much.  

B.Yes , I'd love to .  

C.Not at all.    

D.No, I do't like