Ask Your Question
4

What is the minimum distance that exists between any two nodes in a Binary Search Tree (BST)?

asked 2021-06-20 11:00:00 +0000

devzero gravatar image

edit retag flag offensive close merge delete

1 Answer

Sort by ยป oldest newest most voted
1

answered 2021-10-11 05:00:00 +0000

ladyg gravatar image

The minimum distance between any two nodes in a Binary Search Tree (BST) is 1. This occurs when there are two adjacent nodes with one being the parent and the other being the left or right child.

edit flag offensive delete link more

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account. This space is reserved only for answers. If you would like to engage in a discussion, please instead post a comment under the question or an answer that you would like to discuss

Add Answer


Question Tools

Stats

Asked: 2021-06-20 11:00:00 +0000

Seen: 6 times

Last updated: Oct 11 '21