0 votes 0 votes The following numbers are inserted into an empty binary search tree in the given order: $10,1,3,5,15,12,16$. What is the height of the binary search tree? $3$ $4$ $5$ $6$ Unknown Category ugcnetcse-nov2017-paper2 + – Arjun asked Nov 5, 2017 • edited Jul 13, 2020 by go_editor Arjun 1.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply Hradesh patel commented Jul 13, 2020 reply Follow Share Option A is correct. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes for the better understanding of BST insertion/deletion, you can check this also:https://www.cs.usfca.edu/~galles/visualization/BST.html Hira Thakur answered Nov 9, 2017 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Answer is A = 3. In tree diagram three edges. aniruddha.holey answered Dec 8, 2017 aniruddha.holey comment Share Follow See all 0 reply Please log in or register to add a comment.