In a binary tree where the objects are ordered as a heap except for the root, it is called a$($n$)\_\_\_\_\_\_\_\_\_.$

Question $10$ options:

partial heap

transformed heap

semi$-$heap

broken heap