Skip to main content

Simple binary search tree in c++

I have wrote a simple c++ program for the implementation of Binary search tree.

Credits:MyCodeSchool




Code snippet:
Labels:

Comments

Post a Comment

Popular posts from this blog

Blogger.com VS Wordpress.com

Important : Here we compared Wordpress.com and not Wordpress.org Introduction:      First speaking of blogger. It was developed in Pyra labs then later acquired by Internet giant Google. This is completely free blogging platform written in Python. It integrates with most of google services. I am using blogger for the past two years. It is very compact and comfortable.      After speaking about Wordpress. It is developed by Automattic,Inc powered by opensource CMS(Content Management System) Wordpress written in php. It has very fine features such as landing page, sliders, etc. This is also a free platform but you have an option to get premium service too. I think this intro is good enough. Now let compare their features. Blogger Features: Just one google account is good enough to do anything. Integrates into your Gdrive, Photos,Google+. E-mail feeds are very easy to setup with Google owned Feed Burner service. Simplified user interface. ...
4 comments
Read more

2-Dimensional Array with Dynamic Rows and Columns.

In Programming many times we have to store and work  with the data. But choosing the right way of storing is important. Array is one of the most simple and effective way of storing list of data.Now we have to multiple array of data. Ohh! that sounds easy we can use 2 Dimensional Array. I agree 2 Dimensional array is suitable but I have arrays of variable lengths. So simply creating 2-D Array will not be efficient because I have to specify the column size as the highest of my arrays. So there will be lot of unused space. The good solution can be Dynamic 2D Array with variable columns. Also Array of vectors can also be used. But we are not discussing about STL. Algorithm: Create a ptr to ptr to ptr with the name of your 2D Array to hold the Array of Pointers. Now create an Array of pointers depending on the no of rows and store the base address on the ptr to ptr. For every Row allocate the required memory and store the address in the array of pointers. You own the 2D...
Post a Comment
Read more

One of the best Torrent caching service.

Hi readers, It's been a long time since I made my last post on this blog. That's due to the migration of the blog to private servers.  Today I found a decent torrent caching service, which I have been looking for years. Initially, when I started, I couldn't find the services are really benefiting me. So I went with my own Virtual Private Server in Digital Ocean. I ran a five dollar per month instance for my torrent caching as well as a multipurpose server.  Of course, It has its pros and cons.  Pros: I was able to do anything I wanted. It served as a good multipurpose server. Relatively inexpensive. Cons: You need to be a computer geek for up and running. Even most of the things are automated, still few manual works have to be performed. It takes usual time for downloading unlike caching services(They can do it instantly). Finally, we have a hassle free torrent caching service  Seedr .  It is a free torrent caching servic...
Post a Comment
Read more