How is a binary search tree balanced?

a. By using rotations to rearrange nodes to maintain the tree
b. By using a secondary hash function
c. By sorting the nodes of the tree
d. By avoiding duplicate elements


a. By using rotations to rearrange nodes to maintain the tree

Computer Science & Information Technology

You might also like to view...

The audio subsystem consists of the speakers and a(n) ________

Fill in the blank(s) with correct word

Computer Science & Information Technology

You can use the Control Panel to add a new program in Windows 7

Indicate whether the statement is true or false

Computer Science & Information Technology

Which of the following is true of synchronous DRAM (SDRAM) chips?

A. They transfer data twice for each clock cycle, when compared to DRAM. B. They are synchronized to the system clock. C. They do not have to be re-energized as often as DRAM chips. D. They use pipelining techniques.

Computer Science & Information Technology

A(n) ____ folder is the location where you want to move or copy a file.

A. end B. destination C. target D. personal

Computer Science & Information Technology