Results for "Category: Data Structures"

This is a linked list program that allows you to add nodes to the front, end, and a specified place in the list. You can also delete nodes from the front, end, specific, and/or all node that are the same.

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.

Many a time I found myself needing to display results in 'page' form. And call me old fashioned, devoted to learning or just plain stoopid, but I'd much rather learn how to code something myself than just plug in variables and let a snotty frontpage wizard do it for me. So, here it is, simple code to divide records into 'pages' of your choosing.

Quickly find out the type of variables returned from your adodb recordset. TypeName() function doesn't do the trick. Databases offer additional data types. This script helps solve type problems without having to lookup the name of the numbers returned.

This class is used to interpret phone numbers to and from a database in a specific format. The format is 25 characters long and is explaied withing the script.

A teaching tool that opens both Excel and Text files as data sources using ADO 2.6. The recordset then is streamed into XML for display. Then the XML is transformed back into ADO for updating the data source (Excel file or Text file).

This program implements a doubly linked list as a binary search tree and includes functions to: traverse inorder, preorder & postorder, insert and delete a node, search for a node, and count the height of a given leaf.

Pointers Tutorial. Introduction to pointers for beginners. I hope u find it useful. :)

Hash table management by Jerry Coffin, with improvements by HenkJan Wolthuis.

This is the third installment of the Lessons in C programming tutorials created by me, Alexander. In this lesson I will cover loops. Loops basically do what it sounds like, loop. If you have read lesson 2 you should understand some Boolean expressions. If you do not, you should read it again. When working with loops it is important to understand truth and false. Maybe you should try doing some truth tables with problems.

Now that you have learned all about variables, loops, and if statements it is time to learn the next thing in programming: Functions. Obviously, you should have a good idea about what a function is, as you have used ones like cout before. However, this lesson will be more in detail about not only functions that are already made, but about making your own, or maybe I will continue this later...

This lesson is one on strings. Strings are really arrays, but there are some different functions that are used for strings, like adding to strings, finding the length of strings, and also of checking to see if strings match. Strings are basically sentences, or words. Like, "This is a string".

Template for a doubly linked-list data structure, can be used also for queues and stacks.

produces a link list as a queue. it is part of my billing project and so uses order placing. nothing complicated.

An introduction to linked lists for beginners. I know there are already some. I guess it won't hurt to have another.

a simple vector template.

A simple stack template.

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

This is a heap sort algorithm that implements an array as a heap, sorts as many as 10000 numbers that are randomly generated and writes them to a file called "heap.out".

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