Algorithms

Advanced Data Structures for Algorithms

Andy Vickler

$45.95 $39

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Ladoo Publishing LLC
03 May 2023

Mathematical logic; Algorithms & data structures; Computer architecture & logic design

Series: Algorithms

Summary
Details

Are you studying data science and want to take your learning further ? Data structures are an integral part of data science, machine learning, and algorithms, all aimed at solving programming challenges that might seem insurmountable at the outset.

Advanced Data Structures for Algorithms builds on your current knowledge, taking your learning much deeper and teaching you how to solve even the trickiest of challenges.

This book has been divided into four parts:

Part One covers advanced lists, including:

- An overview of linked lists

- Doubly linked lists

- XOR linked lists

- Self-organizing lists

- Unrolled linked lists

Part Two covers trees, including:

- Segment trees

- Trie trees

- Fenwick trees

- AVL trees

- Red-black trees

- Scapegoat trees

- Treap

- N-ary

Part Three discusses disjoint sets or Union-finds, as they are sometimes known

Part Four covers heaps and priority queues, including:

- A brief discussion on binary heaps

- Binomial heaps

- Fibonacci heaps

- Leftist heaps

- K-ary heaps

- Iterative heapsorts

You'll find plenty of code examples to help you make sense of things and common-sense explanations.

If you want to advance your knowledge of data structures for algorithms you are in the right place.

By: Andy Vickler
Imprint: Ladoo Publishing LLC
Volume: 3
Dimensions: Height: 229mm, Width: 152mm, Spine: 12mm
Weight: 308g
ISBN: 9781955786485
ISBN 10: 1955786488
Series: Algorithms
Pages: 226
Publication Date: 03 May 2023
Audience: General/trade , ELT Advanced
Format: Paperback
Publisher's Status: Active