GATE Computer Science (CS) 2019 Solved Papers

© examsiri.com

Question : 24 of 65

Marks: +1, -0

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?

B+ Tree is a height-balanced tree
Non-leaf nodes have pointers to data records
Key values in each node are kept in sorted order
Each leaf node has a pointer to the next leaf node

Go to Question:

Prev Question

Next Question