What is Binary Tree?
Lesson 2 of 13 in Coddy's Binary Tree - Data Structures Series #3 course.
A binary tree is a data structure that consists of a set of nodes, where each node has at most two children: a left child and a right child. The first node in the tree is called the root. Each node in the tree can have zero, one, or two child nodes, and the child nodes can themselves be the root of another binary tree.
Binary trees are used in a wide variety of applications, including searching, sorting, and data compression. They are also a fundamental data structure in computer science, and are studied extensively in algorithms courses.
Let's create a BinaryTree class!
Try it yourself
This lesson doesn't include a code challenge.
