1.

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

Answer»

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



Discussion

No Comment Found