Exam 22: Binary Trees, Avl Trees, and Priority Queues

Assuming a Node class class Node { int element; Node left,right; Node(int el,Node left,Node right){ element = el; this.left = left; this.right = right; } } Write a method int numberLeaves(Node tree)that returns the number of leaves in the binary tree whose root is tree.

In a binary tree,

Adding all items from a list to a certain data structure and then removing them one at a time yields a sorted version of the list.The data structure is a

The order condition that characterizes a heap states that

A priority queue is