The difference between a binary tree and a binary search tree is that?

(A) A binary search tree has two children per node whereas a binary tree can have none, one, or two children per node
(B) In binary search tree nodes are inserted based on the values they contain
(C) In binary tree nodes are inserted based on the values they contain
(D) None of the above

Related Posts 👇

  • Which of the following is not a correct statement about Table ADT?

    (A) In a table, the type of information in columns may be different
    (B) A table consists of several columns, known as entities
    (C) The row of a table is called a record
    (D) A major use of table is in databases where we build and use tables for keeping information

Leave a Reply

Your email address will not be published. Required fields are marked *