dynDataStructs

dynDataStructs - containing some data and two Binary Trees...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
Dynamic Data Structures Linked Lists Binary Search Trees (BSTs)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Linked Lists A Linked List is either null, or a LLNode containing some data and a Linked List, usually named next . It is most flexible when the list contains a general-purpose Abstract Data Type (ADT) This is usually implemented as (void *)
Background image of page 2
Linked Lists head tail data next data next data next data next = null
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Queues and Stacks
Background image of page 4
Binary Search Trees (BSTs) A Binary Tree is either null, or a BTNode
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: containing some data and two Binary Trees usually named left and right. • A BST is a Binary Tree in which the data at any node is greater than all the data in the left sub-tree, and is less than the data in the right sub-tree. • Note: for any data type, we need to define the meaning of ‘less than’ and ‘greater than’ A BST 50 left right 25 left right 75 left right 90 null null 60 null null 40 null null...
View Full Document

This note was uploaded on 12/17/2009 for the course CS 1372 taught by Professor Smith during the Spring '07 term at Georgia Tech.

Page1 / 10

dynDataStructs - containing some data and two Binary Trees...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online