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

Java    |    Intermediate
• 17 videos | 1h 24m 38s
• Includes Assessment
• Earns a Badge
Rating 4.6 of 26 users (26)
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

• After completing this video, you will be able to recognize the characteristics of binary trees.
• 3.  Breadth-first Traversal
In this video, you will learn how to summarize breadth-first traversal of a binary tree.
• 4.  Depth-first Traversal
In this video, find out how to summarize a depth-first traversal in a binary tree.
• 5.  Depth-first Pre-order Traversal
After completing this video, you will be able to explain depth-first, pre-order traversal in a binary tree.
• 6.  Depth-first In-order Traversal
After completing this video, you will be able to explain depth-first, in-order traversal in a binary tree.
• 7.  Depth-first Post-order Traversal
After completing this video, you will be able to explain depth-first, post-order traversal in a binary tree.
• 8.  Representing a Binary Tree
Learn how to represent a binary tree using the Java programming language.
• 9.  Implementing Breadth-first Traversal
During this video, you will learn how to write and execute code which performs a breadth-first traversal.
• 10.  Viewing Levels in Breadth-first Traversal
During this video, you will learn how to visualize the levels of nodes visited in a breadth-first traversal.
• 11.  Implementing In-order Traversal Using a Stack
Learn how to use in-order traversal to traverse nodes via the left child, parent, and then right child.
• 12.  Implementing In-order Traversal Using Recursion
In this video, you will implement in-order traversal using recursion.
• 13.  Implementing Pre-order Traversal Using a Stack
In this video, find out how to use pre-order traversal to traverse nodes via the parent, left child, and then right child.
• 14.  Implementing Pre-order Traversal Using Recursion
In this video, you will learn how to implement pre-order traversal using recursion.
• 15.  Implementing Post-order Traversal Using a Stack
To use post-order traversal, you must first traverse the left child, then the right child, and finally the parent.
• 16.  Implementing Post-order Traversal Using Recursion
In this video, you will learn how to implement post-order traversal using recursion.
• 17.  Course Summary

## EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

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

Digital badges are yours to keep, forever.

## YOU MIGHT ALSO LIKE

Rating 4.5 of 206 users (206)
Rating 4.5 of 100 users (100)
Rating 4.6 of 14 users (14)

## PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Rating 4.6 of 14 users (14)
Rating 4.6 of 68 users (68)
Rating 4.5 of 100 users (100)