Computing and Information Technology Interactive Digital Educational Library


Computing Course Materials >
Fundamentals of Algorithms >

Please use this identifier to cite or link to this item:

Title: Binary Search Trees
Authors: Choueiry, Berthe
Keywords: ACMCCS98::Data::DATA STRUCTURES::Trees
ACMCCS98::Mathematics of Computing::DISCRETE MATHEMATICS::Graph Theory::Trees
Issue Date: 2007
Publisher: University of Nebrska Lincoln
Abstract: A binary-search tree is a binary tree that satisfied Binary-Search tree property.
Description: In a binary tree for any node x,if y is a node in the left sub-tree of x then key[y]<=key[x].if y is a node in the right sub-tree of x then key[y]>=key[x].
Appears in Collections:Fundamentals of Algorithms

Files in This Item:

File Description SizeFormat
BinarySearchTree.pdf349KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback