May 2017
Intermediate to advanced
340 pages
8h 16m
English
We always get confused with binary trees and binary search trees. As we have seen in the definition, BST is a sorted binary tree. If it is sorted, then we can have the performance improvement compared to a regular binary tree. Each binary tree node can have a maximum of two child nodes, which are known as the left child node and right child node. However, based on the type of binary tree, there can be zero, one, or two child nodes.
We can also classify binary trees into different categories:
Read now
Unlock full access