Related Questions

If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
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)
A group of 2m - 1 routers are interconnected in a centralized binary tree, with router at each tree node. Router I communicate with router J by sending a message to the root of the tree. The root then sends the message back down to J. Then find the mean router-router path length.
Is parent node of Node 3 and root node of the given ternary tree same?
Is parent node of Node 4 and root node of the given K-ary tree same?
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.
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?
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
There is a tree between houses of A and B. If the tree leans on A’s House, the tree top rests on his window which is 12 m from ground. If the tree leans on B’s House, the tree top rests on his window which is 9 m from ground. If the height of the tree is 15 m, what is distance between A’s and B’s house?
The number of distinct nodes the following struct declaration can point to is . . . . . . . .
struct node{ struct node *left; struct node *centre; struct node *right;};