数据结构二叉查找树.pptVIP

* §6 The Search Tree ADT -- Binary Search Trees 【Definition】A binary search tree is a binary tree. It may be empty. If it is not empty, it satisfies the following properties: (1) Every node has a key which is an integer, and the keys are distinct(唯一的). (2) The keys in a nonempty left subtree must be smaller than the key in the root of the subtree. (3) The keys in a nonempty right subtree must be larger than the key in the root of the subtree. (4) The left and right subtrees are also binary search trees. 30 5 2 40 20 15 12 25 10 22 60 70 80 65 1. Definition §6 Binary Search Trees 2. ADT Objects: A finite ordered list with zero or more elements. Operations: ? SearchTree MakeEmpty( SearchTree T ); ? Position Find( ElementType X, SearchTree T ); ? Position FindMin( SearchTree T ); ? Position FindMax( SearchTree T ); ? SearchTree Insert( ElementType X, SearchTree T ); ? SearchTree Delete( ElementType X, SearchTree T ); ? ElementType Retrieve( Position P ); §6 Binary Search Trees 3. Implementations ? Find Position Find( ElementType X, SearchTree T ) { if ( T == NULL ) return NULL; /* not found in an empty tree */ if ( X T-Element ) /* if smaller than root */ return Find( X, T-Left ); /* search left subtree */ else if ( X T-Element ) /* if larger than root */ return Find( X, T-Right ); /* search right subtree */ else /* if X == root */ return T; /* found */ } T( N ) = S ( N ) = O( d ) where d is the depth of X Must this test be performed first? These are tail recursions. §6 Binary Search Trees Position Iter_Find( ElementType X, SearchTree T ) { /* iterative version of Find */ while ( T ) { if ( X == T-Element ) return T ; /* found */ if ( X T-Element ) T = T-Left ; /*move down along left path */ else T = T- Right ; /* move down along right path */ } /* end while-loop */ return N