Many times we need to search for some specific paths in a binary tree from top to bottom. Lets design a code to find out all paths in a binary tee.
Change the left and right pointers of each node in Binary search Tree to make it a sorted doubly linked list.
Many times we need to validate a Binary Search tree i.e. verifying its properties,
What is boost::any : boost::any is a class from Boost::any Library. It provides the ability to store arbitrary information in a variable in C++.
Almost in all applications we need logging functionality, but requirements varies from project to project. Here we have designing a Configurable Logging framework. First of all, lets have a look at full requirements.
Many time we need to perform certain tasks on Binary trees. These tasks can be, Counting nodes that satisfy some criteria. Displaying all nodes in particular pattern like, printing expression from expression tree. Creating mirror image of tree. etc.