Answer the following statements true (T) or false (F)

Question

1) There are four basic ways to traverse a tree, and they are all implemented recursively.
2) A decision tree cannot be used as the basis for an expert system.
3) In an inorder traversal, the elements of a tree are visited in order of their distance from the root.
4) In a postorder traversal, the root is the last element visited in the tree.
5) Recursive methods that work with binary trees are often implemented with a private support method.

Answer 1

1) F
2) F
3) F
4) T
5) T