Question

Construct Binary search tree of following data:
DEC, MAR, APRIL, JAN, JUN, AUG, SEPT, NOV

Answer 1

Answer:

Explanation:

From the above question,

They have given :

A binary search tree (BST) is a type of data structure used to store data in a way that allows for efficient searching, insertion, and deletion of elements.

A BST is a binary tree, where each node has at most two child nodes, left and right. The key feature of a BST is the ordering of the nodes, where the value of the left child node is less than the value of the parent node, and the value of the right child node is greater than the value of the parent node.

       This ordering property allows for efficient search operations, as the search space can be reduced with each comparison. BSTs are widely used in computer science and have many practical applications, such as in database indexing, expression parsing, and spell checking.

                                  APRIL

                                 /     \

                            JAN     SEPT

                                        /      \

                                   MAR    DEC

                                     /

                                NOV

                                  /

                              JUN

                              /

                         AUG

 In a binary search tree, the left child node is always smaller than the parent node and the right child node is always larger. This ordering of the nodes allows for efficient searching, insertion, and deletion of elements in the tree.

                 

For more such related questions : https://brainly.in/question/24145708

#SPJ3