2 2 votes Let P be the set of all integers from $1$ to $15$. Consider any order of insertion of the elements of P into a binary search tree that creates a CBT. Which one of the following elements can never be the third element that is inserted?$4$ $2$ $5$ $10$ Data Structures goclasses gate2026_cs_set1_memorybased data-structures complete-binary-tree two-marks + – GO Classes 757 views answer comment Share Follow Print See 1 comment 1 1 comment reply Complete_Analyzer commented Feb 15 reply Follow flag 2 Mark 0 0 replyShare Please log in or register to add a comment.
0 0 votes 5 Omkar_Patil 4 answered Mar 2 Omkar_Patil 4 comment Share Follow See all 2 Comments 2 2 Comments reply Vishal_Khorwal commented Mar 26 reply Follow flag Brother add some explanation also pls 1 1 replyShare shreyakale commented Sep 11 reply Follow flag @Vishal_Khorwal for the given numbers, there is only one way to fill them in BST if we want our BST to be CBT(complete binary tree). draw the CBT and check that before 5 at least 3 numbers i.e. 8,4,6 need to be inserted . Hence 5 is correct answer 0 0 replyShare Please log in or register to add a comment.
