Discussion Board
Go to the previous messageThere are no next messages
Current Forum: 15-211 Main Forum
Date: Tue Dec 18 2001 10:34 am
Author: Liu, Limin Angela <laliu@andrew.cmu.edu>
Subject: Re: Tree Positions question on Fall 00 Test
Yeah, you are right that only a balanced binary search tree will do searches in O(lgN) time.
Post response
Go to the previous messageThere are no next messages
Current Thread Detail:
Tree Positions question on Fall 00 Test      White, David      Mon Dec 17 2001 5:00 pm       
Re: Tree Positions question on Fall...      Shi, Ying      Mon Dec 17 2001 6:13 pm       
Re: Tree Positions question on F...      White, David      Mon Dec 17 2001 8:46 pm       
Re: Tree Positions question o...      Shi, Ying      Mon Dec 17 2001 9:36 pm       
Re: Tree Positions questio...      White, David      Mon Dec 17 2001 9:48 pm       
Re: Tree Positions ques...      Shi, Ying      Mon Dec 17 2001 9:54 pm       
Re: Tree Positions q...      Liu, Limin Angela      Tue Dec 18 2001 9:54 am       
Re: Tree Position...      White, David      Tue Dec 18 2001 10:18 am       
Re: Tree Posit...      Liu, Limin Angela      Tue Dec 18 2001 10:47 am       
Re: Tree Po...      White, David      Tue Dec 18 2001 1:51 pm       
Re: Tree Position...      White, David      Tue Dec 18 2001 10:21 am       
Re: Tree Posit...      Liu, Limin Angela      Tue Dec 18 2001 10:34 am       
Back to previous screen