Consider the operation of deleting the root of a binary search tree. If the root is a leaf, then
A) the method doing the deletion should throw an exception
B) the root should be replaced with a dummy place-holder node
C) the reference to the root of the tree should be set to null
D) the element stored in the root node should be replaced with null, or with 0.
C) the reference to the root of the tree should be set to null
Computer Science & Information Technology
You might also like to view...
A printer is the physical (hardware) device that produces the printed output
Indicate whether the statement is true or false
Computer Science & Information Technology
__________ are important in compilers and operating systems—insertions and deletions are made only at one end of a __________—its top.
a) Linked lists, linked list b) Queues, queue c) Stacks, stack d) Binary trees, binary tree
Computer Science & Information Technology