100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Data Structures & Search Algorithms Theory. £7.49
Add to cart

Lecture notes

Data Structures & Search Algorithms Theory.

 28 views  1 purchase

This document will go over Data Structures and Algorithms used in every programming languages. Not every topic has an implementation. Also goes over 2 simple search algorithms. Contents Lists Vectors Single Linked Lists Implementation Doubly Linked Lists Trees Binary Tree Binary se...

[Show more]

Preview 4 out of 30  pages

  • June 27, 2021
  • 30
  • 2020/2021
  • Lecture notes
  • James lear
  • All classes
All documents for this subject (2)
avatar-seller
alone
DATA STRUCTURES & SEARCH
ALGORITHMS




Ethan Donovan

,Contents
Lists ......................................................................................................................................................... 2
Vectors .................................................................................................................................................... 3
Single Linked Lists ................................................................................................................................... 3
Implementation ...................................................................................................................................... 5
Doubly Linked Lists.................................................................................................................................. 6
Trees........................................................................................................................................................ 8
Binary Tree .............................................................................................................................................. 9
Binary search tree - Traversal ............................................................................................................... 11
Level Order traversal......................................................................................................................... 11
Pre-order traversal ............................................................................................................................ 12
In-order traversal .............................................................................................................................. 12
Post-order ......................................................................................................................................... 12
Stacks .................................................................................................................................................... 13
Queues .................................................................................................................................................. 17
Hash Tables ........................................................................................................................................... 19
Simple Hash Table Implementation .................................................................................................. 21
Heaps .................................................................................................................................................... 24
Heaps as arrays ................................................................................................................................. 25
Linear Search Algorithm........................................................................................................................ 27
Binary Search Algorithm ...................................................................................................................... 27

,Lists
Lists are abstract data types

, Vectors
Vectors are a thread safe implementation. Meaning you can read and write
code from a vector without having to manually synchronise the data.




Single Linked Lists




When storing things in a linked list you need to store the value that you want
and a reference to the next value you want to store.

This is so that the linked list is aware of other values in the list.

There is a head field. The first node in the list then you can get to any other
item in the list.

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller alone. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for £7.49. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

53068 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy revision notes and other study material for 14 years now

Start selling
£7.49  1x  sold
  • (0)
Add to cart
Added