Advanced Data Structures and Algorithms in Java 9

Advanced Data Structures and Algorithms in Java 9

English | MP4 | AVC 1920Ă—1080 | AAC 48KHz 2ch | 3h 06m | 1.25 GB

Explore the world of advanced algorithms with Java 9

Advanced Data Structures and Algorithms in Java 9 covers classical, functional, and reactive data structures, giving you the ability to understand computational complexity, solve problems, and write efficient code. This video is based on the Zero Bug Bounce milestone of Java 9.We start off with the basics of algorithms and data structures, helping you understand the fundamentals and measure complexity. You will also get a clear picture of reactive programming, binary searches, sorting, search trees, undirected graphs, and a whole lot more!

What You Will Learn

  • Handle reactive programming and its related data structures
  • Use binary search, sorting, and efficient sorting—quicksort and mergesort
  • Work with the important concept of trees and list all nodes of the tree, search trees, and balanced search trees
  • Apply advanced, general-purpose data structures, priority queue-based sorting, and random access immutable linked lists
  • Gain a better understanding of the concept of graphs, directed and undirected graphs, undirected trees, and much more
Table of Contents

01 The Course Overview
02 Quicksort
03 Mergesort
04 A Tree Data Structure
05 The Tree Abstract Data Type
06 Binary Tree
07 Binary Search Tree
08 Self-Balancing Binary Search Tree
09 Red-Black Tree
10 Hash Tables
11 Priority Queue ADT and Heap
12 Linked Heap
13 Binomial Forest
14 Sorting Using a Priority Queue and In-Place Heap Sort
15 What is a Graph
16 The Graph ADT and Adjacency Matrix
17 Adjacency List
18 Producer-Consumer Model
19 Functional Way of Reactive Programming