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

Java SE 13    |    Intermediate
• 10 videos | 52m 20s
• Includes Assessment
Likes 9
A binary search tree is a unique data structure that allows for highly performant insert and lookup operations because, for every value stored in the tree, there is precisely one position where that value can exist. Knowing how to work with this data structure is an essential tool for your software engineering toolkit. In this course, you'll explore the various operations that you can perform on a binary search tree. You'll recognize how the binary search tree works for efficient insert and lookup operations and how to implement the code for these operations. You'll move on to identify the constraints on the nodes of a binary search tree data structure. Finally, you will learn how to write code for various problems that involve binary search trees.

## WHAT YOU WILL LEARN

• discover the key concepts covered in this course
describe the constraints on the nodes of a binary search tree
explain how insertion works in a binary search tree
describe how lookup works in a binary search tree
insert a node into a binary search tree
• look up a node in a binary search tree
find the minimum and maximum value in a binary search tree
print a range of values in a binary search tree
see if a binary tree meets the constraints of a binary search tree
summarize the key concepts covered in this course

## IN THIS COURSE

• After completing this video, you will be able to describe the constraints on the nodes of a binary search tree.
• 3.  Binary Search Tree: Insertion
After completing this video, you will be able to explain how insertion works in a binary search tree.
• 4.  Binary Search Tree: Lookup
Upon completion of this video, you will be able to describe how lookup works in a binary search tree.
• 5.  Implementing Insertion
In this video, you will learn how to insert a node into a binary search tree.
• 6.  Implementing Lookup
In this video, you will learn how to look up a node in a binary search tree.
• 7.  Finding the Minimum and Maximum Values
During this video, you will learn how to find the minimum and maximum value in a binary search tree.
• 8.  Printing a Range of Values
In this video, find out how to print a range of values in a binary search tree.
• 9.  Checking Whether a Tree Is a Binary Search Tree
In this video, you will learn how to determine if a binary tree meets the constraints of a binary search tree.
• 10.  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.

Likes 38
Likes 44
Likes 50

Likes 24
Likes 25
Likes 210