Geeks With Blogs
Fahd Siddiqui [Problem Solved]
The usual solution to find the height of a binary tree follows the recursive algorithm shown below: if node == null: return 0 else return max(height(node.left), height(node.right)) + 1 The usual algorithm won't help you if you are dealing with non binary trees. So, here's an alternate way of finding height of a tree. For purpose of demonstration, I ......

I came across this problem at work that required me to make some dlls a part of the web project, so that when we would deploy the web project, these dlls would be deployed as well. These dlls could be third party dlls, and the idea was that all that needed to be done was drop these dlls in a folder called "Plugins" and it should work. Well, everything ......

Copyright © fahdsiddiqui | Powered by: GeeksWithBlogs.net