Extreme nodes in alternate order

In this article, we will be discussing about the problem "Extreme nodes in alternate order in a Binary tree" in detail. This involve the concept of Breadth First Search (BFS) and Level order traversal.

Contents:

IntroductionOptimized approachImplementationCode ExplanationTime and Space Complexity AnalysisIntroduction:

In this problem at OpenGenus, we are going to print the extreme nodes at each level but in the alternate order in a binary tree i.e, in the first level we'll print the left-...