Arrays and Trees Quiz 1

In a max heap parent nodes have values greater than or equal to the child.

A min heap is a heap where every single parent node is less than or equal to the value of its children nodes.

Yes , min-max heap is a complete binary tree

Average time complexity to insert element in min-max heap is O(logn) , worst case is also same

In min-max heap time complexity is same of insert and delete

Each node in a tree has zero or more child nodes

Top most node is called root node

Root node can act as parent node , but parent node is not always a root node

If a node has more than one parent node then it is not considered as Tree

A node must have utmost one node , but i can have multiple ancestor nodes ( parent’s parent)