I insert new vertices in the tree as follows: left <root <= right. By the "maximum sub-tree" I mean that which is the highest.

My program works as follows:


1. Traversing tree using BFS start...