In an array-based representation of a binary tree, the root node is stored at index 0.State true or false.a)Trueb)False

Which of the following is true for a Binary Search Tree?

In an array-based representation of a binary tree, if a node is at index 5, what are the indices of its left and right children?a)Left: 5, Right: 6b)Left: 10, Right: 11c)Left: 6, Right: 7d)Left: 9, Right: 10

Which of the following is true for a Binary Search Tree?Left and right subtrees contain duplicate elementsRight subtree contains all elements less than the rootLeft subtree contains all elements greater than the rootNone of the above

If the tree is not a complete binary tree then what changes can be made for easy access to the children of a node in the array?Marks : 2Negative Marks : 0

Which of these statements is not true?In a node tree, the top node is called the rootEvery node, except the root, has exactly one parent nodeA node can have any number of childrenA leaf is a node with the same parent