Binary Tree is a tree-like structure that is rooted in which each vertex has at most two children and each child of a vertex is designated as its left or right child. In the next blogs series, we’ll learn about traversing binary trees, binary search trees, and minimum spanning tree.
