With respect to the given context node, marked in pink, evaluate the following axes on the tree. List the pre-identifier of each node that each axis returns. i. following::a ii. ancestor-or-self::node() iii. preceding-sibling::b [3 marks]

<?xml version = "1.0” encoding = "UTF-8"?> <root> <a> <b> <a/> <a/> </b> <b> <a/> </b> <b> <a/> <a> <b/> <b/> </a > <a/> </b> </a> </root>With respect to the given context node, marked in pink, evaluate the following axes on the tree. List the pre-identifier of each node that each axis returns. i. following::a ii. ancestor-or-self::node() iii. preceding-sibling::b

A tree node's unique predecessor is its parent node.Group of answer choicesTrueFalse

Given a BST with n (n>=2) nodes, find the kth common ancestor of nodes x and y in the given tree. Return -1 if kth ancestor does not exist.Nodes x and y will always be present in the input of a BST, and x != y.

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

n a parse tree, the root node always represents a ____ symbol.