Question

Question 2 4 pts Which of the following statements are NOT true about a Binary Search Tree (BST)? A BST can be used to store Customer objects, as long as Customer class implements CompareTo() method Binary Search Trees are primarily used to store and evaluate algebraic expressions Nodes in a BST can typically be processed using a recursive algorithm A BST requires the use of hashing and modulus operations to calculate where to place an item When looking for an item larger than the data in the root, you only need to traverse the left subtree

          Question 2
4 pts
Which of the following statements are NOT true
about a Binary Search Tree (BST)?
A BST can be used to store Customer objects, as
long as Customer class implements CompareTo()
method
Binary Search Trees are primarily used to store
and evaluate algebraic expressions
Nodes in a BST can typically be processed using
a recursive algorithm
A BST requires the use of hashing and
modulus operations to calculate where to place
an item
When looking for an item larger than the data in
the root, you only need to traverse the left
subtree

Question 2
4 pts
Which of the following statements are NOT true
about a Binary Search Tree (BST)?
A BST can be used to store Customer objects, as
long as Customer class implements CompareTo()
method
Binary Search Trees are primarily used to store
and evaluate algebraic expressions
Nodes in a BST can typically be processed using
a recursive algorithm
A BST requires the use of hashing and
modulus operations to calculate where to place
an item
When looking for an item larger than the data in
the root, you only need to traverse the left
subtree

Added by James B.

Question

Please give Ace some feedback