What are the three properties of each node n in a binary search tree?
What will be an ideal response?
The three properties of each node n in a binary search tree are:
• n’s value is greater than all values in its left subtree TL
• n’s value is less than all values in its right subtree TR
• both TL and TR are binary search trees
You might also like to view...
Use the ________ element to configure a table head row group
a. thead b. tgroup c. tbody d. tfoot
Answer the following statements true (T) or false (F)
1. Some instructions require more than a single machine cycle. 2. Computer scientists use the term layering to describe the interconnections that link a computer’s components. 3. Most mainframes are constructed around a motherboard, a metal framework that contains a series of slots for adding peripherals. 4. On a single-bus architecture computer system, all communication between components flows over a single bus. 5. Because the electronic signals controlling a keyboard, a display, a printer, and a disk drive are different, each peripheral device must have its own interface.