Q. Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?<\/p>\n\n\n\n
(A) B+ Tree is a height-balanced tree<\/p>\n\n\n\n
(B) Non-leaf nodes have pointers to data records<\/p>\n\n\n\n
(C) Key values in each node are kept in sorted order<\/p>\n\n\n\n
(D) Each leaf node has a pointer to the next leaf node<\/p>\n\n\n\n
Ans: Non-leaf nodes have pointers to data records<\/p>\n\n\n\n
Solution:<\/p>\n\n\n\n
B+ tree\u00a0is height balance search tree, where key values in each node are kept in sorted order.<\/p>\n\n\n\n
All leaf nodes are at same level and connected to next leaf node.<\/p>\n\n\n\n
Each non-leaf (i.e., internal) node is of the form:<\/p>\n\n\n\n
<P1, K1, P2, K2, \u2026.., Pc-1, Kc-1, Pc><\/p>\n\n\n\n
where c <= a and each Pi is a tree pointer (i.e points to another node of the tree) and, each Ki is a key value. That means each non-leaf (i.e., internal) nodes has only block (i.e., node or tree pointers) and keys. These internal (i.e., non-leaf) node do not contain data record pointers. So, option (B) is not correct.<\/p>\n","protected":false},"excerpt":{"rendered":"
Q. Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table? (A) B+ Tree is a height-balanced tree (B) Non-leaf nodes have pointers to data records (C) Key values in each node are kept in sorted order (D) Each leaf […]<\/p>\n","protected":false},"author":419,"featured_media":154036,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5141],"tags":[5140],"offerexpiration":[],"class_list":["post-154034","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-gate","tag-gate-questions"],"_links":{"self":[{"href":"https:\/\/www.gkseries.com\/blog\/wp-json\/wp\/v2\/posts\/154034","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.gkseries.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.gkseries.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.gkseries.com\/blog\/wp-json\/wp\/v2\/users\/419"}],"replies":[{"embeddable":true,"href":"https:\/\/www.gkseries.com\/blog\/wp-json\/wp\/v2\/comments?post=154034"}],"version-history":[{"count":1,"href":"https:\/\/www.gkseries.com\/blog\/wp-json\/wp\/v2\/posts\/154034\/revisions"}],"predecessor-version":[{"id":154037,"href":"https:\/\/www.gkseries.com\/blog\/wp-json\/wp\/v2\/posts\/154034\/revisions\/154037"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.gkseries.com\/blog\/wp-json\/wp\/v2\/media\/154036"}],"wp:attachment":[{"href":"https:\/\/www.gkseries.com\/blog\/wp-json\/wp\/v2\/media?parent=154034"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.gkseries.com\/blog\/wp-json\/wp\/v2\/categories?post=154034"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.gkseries.com\/blog\/wp-json\/wp\/v2\/tags?post=154034"},{"taxonomy":"offerexpiration","embeddable":true,"href":"https:\/\/www.gkseries.com\/blog\/wp-json\/wp\/v2\/offerexpiration?post=154034"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}