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. Data Structure

  • 1. Statement 1 is true but statement 2 is false
  • 2. Statement 2 is true but statement 1 is false
  • 3. Both the statements are true
  • 4. Both the statements are false
Answer: 1. Statement 1 is true but statement 2 is false
1303 students attemted this question.

Explanation

No Explanation Available.

Share this question with friends

Similar Questions

  1. Two lists, A and B are implemented as singly linked link-lists. The address of the first and last node are stored in variables firstA and lastA for list A and firstB and lastB for list B. Given the address of a node is given in the variable node, the element stored in the node can be accessed by the statement node->data and the address to the next node can be accessed by node->next. Pankaj wants to append list B at end of list A. Which of the following statements should he use?

  2. State true of false.i) A node is a parent if it has successor nodes.ii) A node is child node if out degree is one.

  3. B-tree and AVL tree have the same worst case time complexity for insertion and deletion.

  4. Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?

  5. If node N is a terminal node in a binary tree then its ________

  6. A Kind of tree where every node in a tree can have at most two children.

  7. B-tree of order n is a order-n multiway tree in which each non-root node contains __________

  8. A graph is a collection of nodes, called __________ And line segments called arcs or__________ that connect pair of nodes.

  9. In circular linked list, insertion of node requires modification of?

  10. How many leaf are there in the tree?

  11. In a B+ tree, both the internal nodes and the leaves have keys.

  12. A complete binary tree with 5 levels has how many nodes? (Root is Level 1)

  13. The maximum number of nodes on level I of a binary tree is which of the following? (Root is Level 1)

  14. ._____________ is a data structure in which every individual node consists of INFO to store data and LINK to store the address of the next node.

  15. A variant of linked list in which last node of the list points to the first node of the list is?

  16. A terminal node in a binary tree is called __________

  17. What is the value of the ROOT node in this Tree?

  18. The decision tree structure begins at a node called the _____.

  19. Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?

  20. Given a sequence of number below: 50,60,40,70,45,55,30,80,65,35,25,75,85When creating a binary search tree, what is the height of the tree?

Comments

Add Your Review

Your email address will not be published.

Subscribe to Newsletter!

Subscribe to get latest updates and information.