Data Structures (BCA) 3rd Sem Previous Year Solved Question Paper 2022

Binary Tree:
    • A binary tree is a hierarchical data structure where each node can have at most two child nodes, known as the left child and the right child.
    • Binary trees do not impose any specific order or constraints on the values of nodes.

Binary Search Tree (BST):
    • A binary search tree is a specific type of binary tree where the nodes are organized in a way that for each node, all values in its left subtree are less than the node's value, and all values in its right subtree are greater than the node's value.
    • BSTs are used for efficient searching, insertion, and deletion operations and maintain order among the elements.
In summary, while a binary tree is a general data structure with no ordering constraints, a binary search tree is a specialized binary tree that enforces a specific order of values, making it useful for efficient searching and retrieval of data.