Question 1
The ________ is to visit the nodes level by level. First visit the root, then all children of the root from left to right, then grandchildren of the root from left to right, and so on.
◦ inorder traversal
◦ preorder traversal
◦ postorder traversal
◦ breadth-first traversal
Question 2
In the implementation of BST, which of the following are true?
◦ Node is defined as a static inner class inside BST because it does not reference any instance data fields in BST.
◦ Node has a property named left that links to the left subtree and a property named right that links to the right subtree and a property named right.
◦ Node is defined as an inner class inside BST.
◦ BST contains a property named root. If tree is empty, root is null.
TrUe....FaLsE
True Friendship
Adapoids and omomyoids had longer snouts and are the first “true” primates.
Which of the following statements is true of linkage?
Anterosuperior view of true pelvis (blue)