Statement 1 When A Node Is Split During Insertion The Middle #739
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.<br /> Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.
This multiple choice question (MCQ) is related to the book/course
gs gs121 Data Structures and Algorithms.
It can also be found in
gs gs121 B-Trees - B+ Tree - Quiz No.2.
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.
Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.
Statement 1 is true but statement 2 is false
Statement 2 is true but statement 1 is false
Both the statements are true
Both the statements are false
Similar question(s) are as followings:
Online Quizzes of gs121 Data Structures and Algorithms
Binary Trees - Binary Search Tree - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Binary Search Tree - Quiz No.2
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Preorder Traversal - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
