Which traversal method for a binary tree does the following Pascal code illustrate? Procedure traverse(p:pointer); Begin Ifp<>NIL Then begin Traverse (p^.left); Process(p); Traverse(p^.right) End; End_
A.pre_order
B.middle_order
C.none
D.last_order
第1题:
4.—_________ Mike________ his homework in the evening?
—No,he doesn't.
A. Do;does
B. Does;do
C. Do;do
D. Does;does
第2题:
第3题:
tree.add(6); tree.add(1); tree.add(1); 则遍历树集tree之后,可以输出1,1,6。()
第4题:
第5题:
第6题:
1、tree.add(6); tree.add(1); tree.add(1); 则遍历树集tree之后,可以输出1,1,6。()