Disagree
a BST can have duplicate entries
the 'equal to' term in the definition allows that
I am surprised to see in the Wiki:
"From the above properties it naturally follows that:
- Each node (item in the tree) has a distinct key.
"
The example in the question is definitely wrong in the sen
no a bst cant hve duplicates
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more opti
@Amit
as per wiki, BST definition is
- The left subtree of a node contains only nodes with keys *less than the
node's key*.
- The right subtree of a node contains only nodes with *keys greater than
or equal to the node's key*.
so, this following example is not a BST...
Mohit
On
Can a BST have duplicate entries ??
.8
.../...\
.7..9
/..\/..\
...6...8..8...10
i.e is this a BST .
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
