Binary Search Trees (BST)
Curriculum and historical examination lineage for Binary Search Trees (BST) under Unit 4 (Trees and Hashing) of Data Structures and Algorithms (21CSC201J) at SRMIST.
Historical appearance distribution across SRMIST Formative Tests (CT1, CT2) and University End Semester examinations.
Factual marks weightage of questions asked on this topic in historical examinations.
Representative historical questions extracted directly from SRMIST examination papers.
Construct a binary search tree for the given data 45,39,56,12,34,78,32,10,89,54,67,81. After constructing the tree, insert the elements 93 and 16 in the tree with proper...
While Inserting the elements 71, 65, 84, 69 in an empty Binary Search Tree (BST) in the sequence shown, the element in the lowest level is ________________ (A) 65 (B) 84 (C) 69...
If "in order" traversal is performed in BST, then the resultant is ________________ (A) Elements are in non-increasing order (B) Elements are in decreasing order (C) Elements are...
Write an algorithm for inserting and deleting a node in a binary search tree with example. [8]
Write appropriate algorithm for inserting and deleting a node in a binary search tree. [8]
Examinations where questions for Binary Search Trees (BST) have appeared.
Master Binary Search Trees (BST) in MintAI
Practice past exam questions, test recurring archetypes, and view predictive probability for this topic before your upcoming exam.