b trees indexing

mcqspedia.com has 5 Question/Answers about Topic b trees indexing

In tree structure diagrams, non leaf node is called

In tree structure diagrams, non leaf node is called
  • A. search node
  • B. descendant nodes
  • C. external node
  • D. internal node
  • Correct Answer: Option D

Search value which is present on each node in search tree diagram of order ‘p’ is as

Search value which is present on each node in search tree diagram of order ‘p’ is as
  • A. p - 1
  • B. p - 2
  • C. p + 1
  • D. p + 2
  • Correct Answer: Option A

In tree structure, node which is free of child nodes is called

In tree structure, node which is free of child nodes is called
  • A. descendant nodes
  • B. root node
  • C. leaf node
  • D. search node
  • Correct Answer: Option C

Tree structure diagram in which pointers of data are stored at leaf nodes of diagram is classified as

Tree structure diagram in which pointers of data are stored at leaf nodes of diagram is classified as
  • A. b tree
  • B. None
  • C. None
  • D. None
  • Correct Answer: Option B

Special node in tree structure which has many child nodes and one parent node is called

Special node in tree structure which has many child nodes and one parent node is called
  • A. descendant nodes
  • B. root node
  • C. leaf node
  • D. search node
  • Correct Answer: Option B