Get Advice on Live Video Call
Earn $ Cash $ with
consultations on Bissoy App

Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node. Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.

Correct Answer: Statement 1 is true but statement 2 is false
During the split, the middle key is retained in the right half node and also promoted to parent node. When a key is deleted from the leaf, it is retained in non-leaves, because it can be still a valid separator between keys in nodes below.

Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as

Which of the following statements is not true about a splitting rule at internal nodes of the tree based on thresholding the value of a single feature? , where i ∈ is the index of the relevant feature b) It move to the right or left child of the node on the basis of 1, where ϑ ∈ R is the threshold c) Here a decision tree splits the instance space, X = Rd, into cells, where each leaf of the tree corresponds to one cell d) Splits based on thresholding the value of a single feature are also known as multivariate splits

The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion) i) from root search for the node to be deleted ii) iii) delete the node at what must be statement ii) and fill up statement iii)

Instead of locking index leaf nodes in a two-phase manner, some index concurrency-control schemes use ___________ on individual key values, allowing other key values to be inserted or deleted from the same leaf.

The ________ References pattern stores each tree node in a document; in addition to the tree node, the document stores the id of the node’s parent.

The number of distinct nodes the following struct declaration can point to is . . . . . . . .
struct node{ struct node *left; struct node *centre; struct node *right;};

If a + b + c + d = 4, then find the value of $$\frac{1}{{\left( {1 - a} \right)\left( {1 - b} \right)\left( {1 - c} \right)}}$$     + $$\frac{1}{{\left( {1 - b} \right)\left( {1 - c} \right)\left( {1 - d} \right)}}$$     + $$\frac{1}{{\left( {1 - c} \right)\left( {1 - d} \right)\left( {1 - a} \right)}}$$     + $$\frac{1}{{\left( {1 - d} \right)\left( {1 - a} \right)\left( {1 - b} \right)}}$$     is?

If a + b + c + d = 4, then the value of $$\frac{1}{{\left( {1 - a} \right)\left( {1 - b} \right)\left( {1 - c} \right)}}$$     + $$\frac{1}{{\left( {1 - b} \right)\left( {1 - c} \right)\left( {1 - d} \right)}}$$     + $$\frac{1}{{\left( {1 - c} \right)\left( {1 - d} \right)\left( {1 - a} \right)}}$$     + $$\frac{1}{{\left( {1 - d} \right)\left( {1 - a} \right)\left( {1 - b} \right)}}$$     is?

Having built a decision tree, we are using reduced error pruning to reduce the size of the tree. We select a node to collapse. For this particular node, on the left branch, there are 3 training data points with the following outputs: 5, 7, 9.6 and for the right branch, there are four training data points with the following outputs: 8.7, 9.8, 10.5, 11. What were the original responses for data points along the two branches (left & right respectively) and what is the new response after collapsing the node?

What does the below definations convey? i. A binary tree is balanced if for every node it is gonna hold that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1. ii. A binary tree is balanced if for any two leaves the difference of the depth is at most 1.