Computer Science, asked by slnchary8921, 1 year ago

Write a procedure to find the maximum and minimum elements of a Binary Search Tree (BST).

Answers

Answered by Shenron

0

Min: begin with root and move left until the node's left is not null
Max: begin with the route and move right until the node's write is not null

Previous Question

Next Question

Similar questions

Math, 6 months ago

find the reminder when x power 4+x power 3 is divided by x...

Science, 6 months ago

Do you know the names of any rivers...

Sociology, 6 months ago

Dear children, you listen to the social science program on radio with great enthusiasm. Which of the following is technically helpful for its transmission?

Math, 1 year ago

Find cost price if selling price is equal to rupees 77 and gain is equal to 10%...

Accountancy, 1 year ago

What is a controller's cushion?

Environmental Sciences, 1 year ago

a thing which we put in mouth and put into a hole...

English, 1 year ago

What is the Second form of beat??

Physics, 1 year ago

The horizontal range of a projectile is 4\sqrt{3} times its maximum height. Its angle of projection will be [J & K CET 2004; DPMT 2003] A) {{45}^{o}} B) {{60}^{o}} C) {{90}^{o}} D) {{30}^{o}}...