Mark: 3 revision(s)

2008-11-03T05:09:51Z

3 revision(s)

New page

<html>
<table>
<tr>
<td bgcolor="#552200" width="1000">
<image src="http://www.rajithaonline.com/SE250/httb/pointers/final/uses_head.png" width="353" height="92" alt="Uses Header Logo" />
</td>
</tr>
</table>
</html>

{{SE250:HTTB:NAV
|prev=SE250:HTTB:Pointers:Function_pointers
|next=SE250:HTTB:Pointers:Common_pointer_mistakes}}

=== Pointer use in other topics ===
==== Linked Lists ====
A linked list structure is made of data cells ordered and linked by pointers.
Example: Definition for data cell
<Pre>
typedef struct {
int data;
struct node *next;
} cell;
</Pre>
Every instance of a data cell contains a pointer which can point to the next data cell in the list.

For more details read [[SE250:HTTB:WIP:Linked_Lists|Linked Lists]]

==== Array-based Lists ====
An array-based list structure consists of a defined "node" pointing to the start of an array.
Example:
<Pre>
typedef struct {
int *start;
int capacity;
int length;
} Arraylist
</Pre>
The data in the array can be modified by applying [[SE250:HTTB:WIP:Pointers#Pointer_Arithmetic|Pointer Arithmetic]] on the *start pointer.

For more details read [[SE250:HTTB:WIP:Array-based_Lists|Array-based Lists]]

==== Binary Search Trees ====
A binary search tree consists of "nodes", with each node having pointers to neighbouring nodes.
Example:
<Pre>
typedef
struct Node {
int data;
struct Node *left;
struct Node *right;
struct Node *parent;
} Node;
</Pre>
Each node will store data as well as point to other adjacent nodes. This is similar to the data cells of a linked list.

For more details read [[SE250:HTTB:WIP:Binary_Search_Trees|Binary_Search_Trees]]

{{SE250:HTTB:NAV
|prev=SE250:HTTB:Pointers:Function_pointers
|next=SE250:HTTB:Pointers:Common_pointer_mistakes}}

SE250:HTTB:Pointers:Uses of pointers - Revision history

Mark: 3 revision(s)