Advanced Data Structures & Algorithms in Java: Working With Binary Trees

Java SE 13
  • 17 Videos | 1h 32m 8s
  • Includes Assessment
  • Earns a Badge
Likes 6 Likes 6
A solid understanding of data structures and algorithms is fundamental to writing clean, performant, fast, and robust programs without relying on scarce resources. To capitalize on this, Software Engineers need to recognize the core concepts of basic data structures, their characteristics, and the algorithms behind them. In this course, you'll identify the basic structure and representation of a binary tree and tree traversal algorithms. You'll learn how binary trees are essentially nodes that have references to their left and right children. You'll explore how nodes of a binary tree can be traversed using depth-first traversal and breadth-first traversal. Finally, you'll recognize the three flavors that exist for depth-first traversal: pre-order, post-order, and in-order traversal.

WHAT YOU WILL LEARN

  • discover the key concepts covered in this course
    recognize the characteristics of binary trees
    summarize breadth-first traversal in a binary tree
    summarize depth-first traversal in a binary tree
    explain depth-first, pre-order traversal in a binary tree
    explain depth-first, in-order traversal in a binary tree
    explain depth-first, post-order traversal in a binary tree
    represent a binary tree using the Java programming language
    write and execute code which performs breadth-first traversal
  • visualize the levels of nodes visited in breadth-first traversal
    use in-order traversal to traverse nodes via the left child, parent, and then right child
    implement in-order traversal using recursion
    use pre-order traversal to traverse nodes via the parent, left child, and then right child
    implement pre-order traversal using recursion
    use post-order traversal to traverse nodes via the left child, right child, and then parent
    implement post-order traversal using recursion
    summarize the key concepts covered in this course

IN THIS COURSE

  • Playable
    1. 
    Course Overview
    1m 57s
    UP NEXT
  • Playable
    2. 
    Characteristics of Binary Trees
    10m 37s
  • Locked
    3. 
    Breadth-first Traversal
    6m 35s
  • Locked
    4. 
    Depth-first Traversal
    3m 29s
  • Locked
    5. 
    Depth-first Pre-order Traversal
    5m 29s
  • Locked
    6. 
    Depth-first In-order Traversal
    4m 54s
  • Locked
    7. 
    Depth-first Post-order Traversal
    4m 20s
  • Locked
    8. 
    Representing a Binary Tree
    5m 13s
  • Locked
    9. 
    Implementing Breadth-first Traversal
    6m 19s
  • Locked
    10. 
    Viewing Levels in Breadth-first Traversal
    5m 36s
  • Locked
    11. 
    Implementing In-order Traversal Using a Stack
    7m 51s
  • Locked
    12. 
    Implementing In-order Traversal Using Recursion
    2m 55s
  • Locked
    13. 
    Implementing Pre-order Traversal Using a Stack
    5m 29s
  • Locked
    14. 
    Implementing Pre-order Traversal Using Recursion
    3m 6s
  • Locked
    15. 
    Implementing Post-order Traversal Using a Stack
    6m 47s
  • Locked
    16. 
    Implementing Post-order Traversal Using Recursion
    2m 28s
  • Locked
    17. 
    Course Summary
    1m 33s

EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

Skillsoft is providing you the opportunity to earn a digital badge upon successful completion of this course, which can be shared on any social network or business platform

Digital badges are yours to keep, forever.