adplus-dvertising
frame-decoration

Question

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

a.

descendant nodes

b.

root node

c.

leaf node

d.

search node

Posted under DBMS

Answer: (c).leaf node

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. In physical ordered record files, the non key field for which the records does not have distinct values is classified as

Q. The search value which is present on each node in search tree diagram of order 'p' is as

Q. The kind of index in which the records have fixed length with only two fields is classified as

Q. In tree structure diagrams, the non leaf node is called

Q. The types of access that are supported efficiently are called as ________

Q. The time it takes to find a particular data item is called as ___________

Q. The time it takes to insert a new data item is called ____________

Q. The time it takes to delete a data item is called as _________

Q. The additional space occupied by an index structure is called as _________

Q. If the file containing the records is sequentially ordered, a ___________ is an index whose search key also defines the sequential order of the file.

Q. State true or false: Clustering indices are also called as primary indices

Q. If an index entry appears for every search key value in the file, it is called as ________

Q. If an index entry appears for only some of the search key values in the file, it is called as ________

Q. Indices with two or more levels are called as?

Q. A search key containing more than one attribute is called a _________ search key

Q. State true or false: B+ trees are not always balanced trees.

Q. What are the leaf nodes in a B+ tree?

Q. Non-leaf nodes are also called as __________

Q. The queries used to find all records with search key values in a particular range are known as ________

Q. Statement 1: Insertion of record might require the change in position of the initial nodes.
Statement 2: Deletion of records might require the change in position of the initial nodes.