0 votes 0 votes The following numbers are inserted into an empty binary search tree in the given order: 1000, 452, 131, 15, 85, 75. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)? DS go-ds-1 data-structures binary-search-tree numerical-answers + – Arjun asked Oct 10, 2016 Arjun 310 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply tamil93 commented Jan 16, 2017 reply Follow Share Ans given is 5 . it can be 6 also rite ? if we consider root as 1 instead of 0 0 votes 0 votes arya_stark commented Jul 8, 2018 reply Follow Share Height is 5 And Level is 6 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes .... Hira Thakur answered Nov 16, 2017 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.