单项选择题

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
<上一题 目录 下一题>
热门 试题

单项选择题
A
单项选择题
A virtual memory system has five virtual pages numbered zero through four and three page frames. All the page frames are initially empty. How many page faults are generated with the following access sequence using a FIFO replacement policy0 1 2 3 0 1 4 0 1 2 3 4
A．8
B．9
C．10
D．11
相关试题