27 votes 27 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 (the height is the maximum distance of a leaf node from the root)? $2$ $3$ $4$ $6$ DS gatecse-2004 data-structures binary-search-tree easy isro2009 + – Kathleen asked Sep 18, 2014 • edited Dec 18, 2017 by kenzou Kathleen 22.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Height is 3 Vasudevarnabmessi answered Mar 18, 2023 Vasudevarnabmessi comment Share Follow See all 0 reply Please log in or register to add a comment.
–3 votes –3 votes Why not height at root considered as 0 As per that the height is 2 Please correct me Swami patil answered Dec 4, 2017 Swami patil comment Share Follow See 1 comment See all 1 1 comment reply Puja Mishra commented Dec 23, 2017 reply Follow Share Read definition of height of tree ... which is # of longest edges from root to leaves .... and height of node ... which is # of longest edges from that node to leaves .... 5 votes 5 votes Please log in or register to add a comment.