True or false question 1.Trees can be described either as structures whose eleme

Question

True or false question
1.Trees can be described either as structures whose elements have a hierarchy or as a special form of recursive structure. 2. Hashing isn’t an efficient method for finding an object within a collection . 3. A hash is like the array in that it is a collection of scalar data with individual elements selected by some index value. True or false question
1.Trees can be described either as structures whose elements have a hierarchy or as a special form of recursive structure. 2. Hashing isn’t an efficient method for finding an object within a collection . 3. A hash is like the array in that it is a collection of scalar data with individual elements selected by some index value. 1.Trees can be described either as structures whose elements have a hierarchy or as a special form of recursive structure. 2. Hashing isn’t an efficient method for finding an object within a collection . 3. A hash is like the array in that it is a collection of scalar data with individual elements selected by some index value.

Explanation / Answer

1. True

Trees are known as non linear data structure. They don't store data in a linear way. Trees store data in a hierarchical manner or a form of recursive structure.

Ex:- A family tree with relations from all children.

2. False

Hash table is the collection of items to make it easier to find them later.

3. True

A hash table is the collection of items that is similar to an array.

The mapping between the item and the slot where the item belongs is done by the hash function.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.