0 votes 0 votes While inserting an element into a BST, we will pass the element’s predecessor and successor (if they exist). (a) Ture (b) false (c) can't be determined. DS data-structures binary-search-tree + – dd asked Nov 21, 2016 recategorized Jul 6, 2022 by Lakshman Bhaiya dd 312 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes while inserting elements into BST we are not consider predecessor and successor.just compare with root element and it goes to correct place. when we perform delete operation then we consider either predecessor or successor. santhoshdevulapally answered Nov 22, 2016 santhoshdevulapally comment Share Follow See all 0 reply Please log in or register to add a comment.