'Data structures hiram college' presentation slideshows

Balanced Trees

387 views • 38 slides

Graphs

Graphs. Ellen Walker CPSC 201 Data Structures Hiram College. Basic Graph Terminology. Edge (link). cycle. C. A. C. A. No cycle. D. D. B. cycle. B. Vertex (node). Path. E. E. Directed Graph. Undirected Graph. V = {A,B,C,D,E} E = {(A,B), (A,E), (A,D), (D,E), (A,C).(C,A)}.

425 views • 27 slides

Variations on Linked Lists

Variations on Linked Lists. Ellen Walker CPSC 201 Data Structures Hiram College. Linked List (review). Each element contains two parts: Value of this element Pointer to the next element class string_node { Private: string val; string_node *next; }.

381 views • 23 slides

ADT Binary Search Tree

ADT Binary Search Tree. Ellen Walker CPSC 201 Data Structures Hiram College. Binary Search Tree. Value-based storage of information Data is stored in order Data can be retrieved by value efficiently Is a binary tree Everything in left subtree is < root

471 views • 23 slides

ADT Binary Search Tree

ADT Binary Search Tree. Ellen Walker CPSC 201 Data Structures Hiram College. Binary Search Tree. Value-based storage of information Data is stored in order Data can be retrieved by value efficiently Is a binary tree Everything in left subtree is < root

241 views • 23 slides

Variations on Linked Lists

Variations on Linked Lists. Ellen Walker CPSC 201 Data Structures Hiram College. Linked List (review). Each element contains two parts: Value of this element Pointer to the next element class string_node { Private: string val; string_node *next; }.

334 views • 23 slides

Recursion

Recursion. Ellen Walker CPSC 201 Data Structures Hiram College. Divide & Conquer. To solve a big problem, break it down into smaller problems Examples: Find the largest element in a list by comparing pairs of elements

434 views • 21 slides

Stacks

135 views • 13 slides