5
Contributors
5
Replies
6
Views
6 Years
Discussion Span
Last Post by Rashakil Fol
-1

Proof Let T be a binary search tree, and let S be a subtree of T. Let x
be any element oin S and let TL and TR be the left and right subtrees,
respectively, of x in S. Then since S is a subtree of T, x is also an element
of T, and TL and TR are left and right subtrees of x in T. Therefore,
y x z for every y 2 TL and every z 2 TR. Therefore, S too has the
Binary Search Tree (BST) property.
6

Votes + Comments
Let the guy do his own homework. Give him a hint, not the answer
0

That sounds correct (assuming you've defined a BST accordingly).

If you want to be really anal you should explicitly point out that S is a binary tree.

This question has already been answered. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.