Consider the binary tree .
We are using the notation in which a binary tree has the root , the left sub-tree and the right subtree , and the symbol "-" means that there is no sub-tree at the respective position. We can also just write to denote a leaf (instead of ).

Question

Consider the binary tree   .  
 We are using the notation in which a binary tree    has the root   , the left sub-tree    and the right subtree   , and the symbol "-" means that there is no sub-tree at the respective position. We can also just write    to denote a leaf (instead of   ).

Accepted Answer

is a binary search tree.

Answer

The result of    returns the tree   .

Answer

represents a heap (there is a heap, i.e., an array, that can be interpreted as this tree).

Answer

The result of    returns the tree   .

Answer

The result of    returns the tree  .

Answer

The result of    returns the tree   .

Crowdly

Consider the binary tree . We are using the notation in which a binary tree...

Хочете миттєвий доступ до всіх перевірених відповідей на www.moodle.aau.dk?