While creating BST we follow the rule that element on the left hand side of the root should be less than or equal to the root element and element on the right hand side of the root should be greater than or equal to the root element. For binary tree we don't follow any rule for creating it.
Data structure for both BST & binary tree: we use a simple structure that holds a data value and pointer to its left and right child. On Tue, Aug 3, 2010 at 10:18 AM, UMESH KUMAR <kumar.umesh...@gmail.com>wrote: > what is the main difference b/w BST and Binary tree for the > purpose of implementation . > and what is the Data structure of that. > > -- > 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<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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 options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
