4

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

edit

• nim

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

devzero
51 ●1 ●4 ●4

edit retag flag offensive close merge delete

add a comment

1

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

ladyg
21 ●1 ●2

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

add a comment

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