In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called ________.

In a binary tree, the node that is directly above another node is called the _____ of that node.a)parentb)leafc)childd)sibling

What are null nodes filled with in a threaded binary tree?

Binary trees with threads are called _________.

In linked representation of Binary trees LEFT[k] contains the ........ of at the node N, where k is the location. Options Data Location and left child Right child address Null value

What are double and single threaded trees?Marks : 1Negative Marks : 0Answer hereUsing single and double linked listsHaving 2 and 1 nodeWhen both left, right nodes are having null pointers and only right node is null pointer respectivelyUsing heaps and priority queues