How to find median of a BST?
Submitted by: AdministratorFind 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.
Submitted by: Administrator
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.
Submitted by: Administrator
Read Online Programming Algorithms Job Interview Questions And Answers
Top Programming Algorithms Questions
☺ | How to find median of a BST? |
☺ | Define and describe an iterative process with general steps of flow chart? |
☺ | State recursion and its different types? |
☺ | What is ARCBALL? |
☺ | What are the two ways through which the Markov algorithm terminates? |
Top Coding/Programming Categories
☺ | Python Interview Questions. |
☺ | OOP Interview Questions. |
☺ | Software engineering Interview Questions. |
☺ | PHP Interview Questions. |
☺ | VBA (Visual Basic for Applications) Interview Questions. |