Answer the following statements true (T) or false (F)
1. If an attempt is made to use pop on an empty stack, an error should occur.
2. In a queue, elements are inserted and removed from the same end.
3. In a binary tree, each node may have links to any number of subtrees.
4. The key of every node in a binary search tree must be larger than every key of every node in its left subtree and smaller than every key of every node in its right subtree.
5. Searching a binary search tree is an O(n/2) process.
1. True
2. False
3. False
4. True
5. False
You might also like to view...
Which character is used as a substitution variable in APEX?
A) & B) ; C) : D) *
Which of the following is the simplest way to change the Based on Style?
A) Styles Gallery Options in the Styles group B) Style Inspector in the Styles group C) Modify Styles in the Styles group D) Manage Styles in the Styles group