Draw the sequence of BSTs that results when you insert the keys E, A, S, Y, Q, U, E, S, T, I, O, N, in that order into an initia
lly empty tree. And draw the sequence of BSTs that results when you delete the keys from the tree one by one in the order they were inserted. (Note: here your BST should allow duplicate keys).
1 answer:
Answer:
answer is attached
Explanation:
An important special kind of binary tree is the binary search tree (BST). In a BST, each node stores some information including a unique key value, and perhaps some associated data. A binary tree is a BST iff, for every node n in the tree:
All keys in n's left subtree are less than the key in n, and
all keys in n's right subtree are greater than the key in n.
Note: if duplicate keys are allowed, then nodes with values that are equal to the key in node n can be either in n's left subtree or in its right subtree (but not both). In these notes, we will assume that duplicates are not allowed.
Here are some BSTs in which each node just stores an integer key:
You might be interested in
Solution :
The nuclear reaction for boron is given as :
And the reaction for Cadmium is :
We know that it is easier that to shield or stop an alpha particle (i.e. He nucli) as they can be stopped or obstructed by only a few centimetres of the material. However, the gamma rays ( γ ) can penetrate through the material to a greater distance. Therefore, we can choose the first one.