Content: v25_vizualnoye_modelirovaniye_operatsiy_v_dereve.zip (1.92 MB)
Uploaded: 08.06.2014

Positive responses: 0
Negative responses: 0

Sold: 0
Refunds: 0

Seller: Gekodis
information about the seller and its items

Ask a question

Loyalty discount! If the total amount of your purchases from the seller more than:

$1 the discount is 1%
$10 the discount is 2%
$25 the discount is 3%
$50 the discount is 10%
$99 the discount is 20%
$9.95
Type: Course work

Subject: Structures and data processing algorithms

Theme: "The visual simulation of operations in the tree"

Institution: Institute

Implementation: Borland DELPHI 2010

The approach to programming: OOP (Object Oriented Programming)



The structure of the explanatory note:


Introduction 4

1. The mathematical formulation of the problem 5

2. Description of the program 8

2.1. The block diagram of the program 8

2.2. Features Designed for Class 8

2.3. Description Plug-in 9

2.4. Features of the software implementation of the algorithm 10

3. User Guide 11

4. TEST PROCEDURE 15

Conclusion 16

Literature 17

APPENDIX 17

The project file TreeView.dpr 17

File MainUnit.pas head module 18

File class implementation Class_TTree.pas 24

File class implementation Class_PaintTTree.pas 28

File module AdditionProcedure.pas 30

File module UnitDeclaration.pas 30

File module window screen LoadForm.pas 31



Implementation details:

• Automatic and manual creation of a tree;

• Graphic display of the tree;

• Animation traversal;

• Adding and removing nodes of the tree.


Statement of the problem (task):

It needs to develop a program which, when run on a computer screen are shown performing operations forming wood, inclusion and exclusion in the tree and its bypassing of the following methods:

• Direct tree traversal;

• Balanced tree traversal;

• Limit tree traversal;

• Bypass tree wide

The contents of the archive:

- Source code in a project Borland Delphi 2010;

- Compiled executable (exe);

- Explanatory note.


The size of zip archive ~ 2,0 Mb

No feedback yet