Home › AP Computer Science A › Computer Science › Data Structures and Algorithms › A tree that uses ordering properties of the data…
A tree that uses ordering properties of the data to keep elements in a searchable hierarchy is a:
ACircular link chain
BPriority stack list
CBinary search tree
DBalanced hash chain
Answer & Solution
Correct answer: C. Binary search tree
1. Search runs down the hierarchy.
2. Order decides left from right.
3. It is a binary search tree.
_Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._
Related questions
A well-known algorithm that showcases design principles useful across many problems is calIn a heap, the element that can always be reached most efficiently sits at the:A collection where every element carries an associated priority value is a:Instead of narrowing down a sorted list by comparisons, hashing can index an element direcA structure stores and retrieves elements in an array indexed by hash value. That structurMapping each object to an integer so that different objects get different integers is the Another sorting algorithm partitions data around a chosen element and recurses on each sidOne canonical divide and conquer algorithm for comparison sorting splits a list and merges