Home
About Us
Contact Us
Bookmark
Saved Bookmarks
Current Affairs
General Knowledge
Chemical Engineering
UPSEE
BSNL
ISRO
BITSAT
Amazon
ORACLE
Verbal Ability
→
Algorithm Tutorial
→
Algorithm Interview Questions in Algorithm Tutorial
→
How To Find Median Of A Bst?
1.
How To Find Median Of A Bst?
Answer»
FIND
the no. of elements on the
LEFT
side.
If it is n-1 the
ROOT
is the median.
If it is more than n-1, then it has already been found in the left
SUBTREE
.
Else it should be in the
RIGHT
subtree
Show Answer
Discussion
No Comment Found
Post Comment
Related InterviewSolutions
What Is Huffman Coding?
What Is Best-first Search Algorithm?
What Is The Linear Search Algorithm?
Provide A Short Description Of Binary Search Algorithm.?
Which Are The Main Steps Of A Merge Sorting Algorithm?
What Is Merge Sorting?
What Is The Difference Between Selection And Insertion Sorting?
Shortly Describe The Quicksort Algorithm.?
Which Are The Advantages Provided By Insertion Sort?
Describe On Short An Insertion Sorting Algorithm.?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies