How to find the smallest and largest value from a binary search tree without extra variable?

+2 votes

487 views

c
data structures
tree

posted Oct 30, 2014 by anonymous

Share this question

Your comment on this post:

Email me at this address if a comment is added after mine:Email me if a comment is added after mine

Privacy: Your email address will only be used for sending these notifications.

Anti-spam verification:

To avoid this verification in future, please log in or register.

1 Answer

0 votes

For finding smallest value in BST traverse left most node of the given BST.
For finding largest value in BST traverse right most node of the give BST.

answer Dec 7, 2015 by Rajan Paswan

Your comment on this answer:

Email me at this address if a comment is added after mine:Email me if a comment is added after mine

Privacy: Your email address will only be used for sending these notifications.

Anti-spam verification:

To avoid this verification in future, please log in or register.

Your answer

Preview

Email me at this address if my answer is selected or commented on:Email me if my answer is selected or commented on

Privacy: Your email address will only be used for sending these notifications.

Anti-spam verification:

To avoid this verification in future, please log in or register.