Which of the following is preorder processing for a binary tree?
a)
i) process the right subtree
ii) process the root node data
iii) process the left subtree
b)
i) process the left subtree
ii) process the root node data
iii) process the right subtree
c)
i) process the root node data
ii) process the left subtree
iii) process the right subtree
d)
i) process the left subtree
ii) process the right subtree
iii) process the root node
e)
i) process the right subtree
ii) process the left subtree
iii) process the root node
c)
i) process the root node data
ii) process the left subtree
iii) process the right subtree
Part b) is in order. Part d) is post order.
You might also like to view...
What virtual environment tool allows for testing and experimentation within a guest OS while providing a means to roll-back to a previous stable state in just seconds?
A. File-by-file backup B. Snapshots C. Hard drive image D. Bit-stream image backups
You can give a state a new name called a(n) ____.
A. capital B. snapshot C. index D. resolution