Data Structure and Algorithms Quiz: Sorting Methods and Search Algorithms

The main difference is that in a binary search tree, the left child of a node contains a value less than the node, and the right child contains a value greater than the node.

AVL trees are self-balancing binary search trees, where the heights of the two child subtrees of any node differ by at most one. Their significance lies in maintaining a balanced tree structure, which ensures efficient search, insertion, and deletion operations.

Linear search sequentially checks each element in the list for the target value, while binary search requires the list to be sorted and performs a divide-and-conquer strategy to find the target value. Binary search has a time complexity of O(log n), while linear search has a time complexity of O(n).