Blog: Consider a binary search tree (BST) that is initially empty. Draw the tree that will result if the following numbers are inserted in the order given: 7, 3, 8, 1, 6, 2, 9, 5.

Thursday, 3 November 2011

Consider a binary search tree (BST) that is initially empty. Draw the tree that will result if the following numbers are inserted in the order given: 7, 3, 8, 1, 6, 2, 9, 5.

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)