Results for "Category: Data Structures"

Demonstration of Reverse Polish Notation expression calculation using Stacks.

Demonstration of expression trees. Creating and evaluationg an expression tree, a special type of binary tree.

The following code, when running, looks like the text is actually typing itself. This technique uses two main things, char arrays and the Sleep(); function. This technique would be great to use for slash screens, presentations or just impressing your friends! Also, please take the time to vote for my code. Thanks!!

This program covers character arrays, structures, and unions - three VERY powerful features of C++. The first part, character arrays, explains and demostrates the use of the [] operators when dealing with strings. The second part, structures, demostrates the use of structures in real-world applications and defines the differences/similarities between structures and classes. The third and final part, unions, identifies the word 'unions' as a keyword, shows how their used and gives a copy-and-pastable example.

This is simple example of doubly linked list. You can insert/delete items anywhere in the list.

A simple stack template.

a simple little list template, done for practice. Comes with example driver.

a simple vector template.

in recursion we have limited stack to keep data. so when we try to find the solution of tower of honai for 5, we get in trouble. to solve this problem we've non recursive solution of it.

Advance Pointers

THis is a scheduling algorhim simulator very cool

I hope that this code will be helpful to those (specially the beginners) who want to know about using linked lists. This is actually a very simple program which shows the basic linked list operations like insertion, deletion, searching, modifying and traversing. Any queries related to this code is very welcome. Tell me if this piece of code was useful to you !!

This BST code will be useful to everyone who wants to know about the basic operations of a BST like Insertion, Deletion, Make Empty, Find Minimum, Find Maximun, Search, Traverse Ascending, and Traverse Descending. Do leave some comments on this code!!

The code is for creating adding deleting and printing

Introduction to C++ STL vector - a C++ standard class that acts similarily to a C array. No 3rd party classes, this is all standard among every standards compliant C++ compiler! The major benefit to the vector is that it is dynamic in size. You can add to it, remove from it, and not have to worry about handling the memory yourself. Very useful.

*Now compatible with MSVC* This is a class called HINT (or "Huge Int"). You use an object as you would any built-in data type with respect to all math operators (+ - * / % ++ --) and logical operators (> = == !=) and the standard insertion and extraction operators (>). Basically it's an integer of limitless size. The main difference from an int (other than the hugeness) is that you can assign it strings of numbers, and in some cases you have to, such as if you want to deal with a number that's too lar for the program to handle. Here's an example: HINT huge = "987654321012345678901231231236549878765431" cout

You can learn Pointer & Link List easily. Familiar with Link List

learn all about a single linked lists (adding and deleting nodes). Sorting works but it is not sorting the linked list itself but sorting array then transfering back into linked list.

all stack operations

Converts a given postfix expression into Infix Expression using stack of pointers.