Binary Algorithm

Written by :

Manasi Muglikar - 2012A3TS247H

This algorithm considers only the first aesthetic thats states that all the nodes that are on the same level are in a straight line as well as the second aesthetic, that in a binary tree, each left son should be posi-tioned left of its father and each right son right of its father. A counter holding the next free x-coordinate is kept for each level of the tree. We assume that each node has a width and height of one unit and that there should be one unit gaps between the levels of the tree and between the nodes across a level. In this and later algorithms, sacing between levels or nodes can be changed by modifying the spacing constants. This algorithm positions parents before children: any tree walk is acceptable so long as each node is visited after its relatives to the left on the same level. All programs assume that the father of the root is nil

The first aesthetic

states that the nodes that are on the same level(i.e have the same height) should be in a straight line, and the lines defining the levels should be parallel.

The second aesthetic

In a binary tree, a left son should be positioned left of its father and each right son right of its father.

Variables used :

Variables used inside the Structure(tree)

left_son : INTEGER

Accepts 1 or 0, true(=1) if left son exists for the given node

right_son : INTEGER

Accepts 1 or 0, true(=1) if right son exists for the given node

left_son_index : INTEGER

Index of the left child of the current node

right_son_index : INTEGER

Index of the right child of the current node

height : INTEGER

The height of the node

x : INTEGER

The x value of node as calculated

y : INTEGER

The y value of node as calculated

father : INTEGER

Index value of father

status : INTEGER

Status value of node as calculated or assigned

end : INTEGER

The variable useful for break condition

Local Variables

root : INTEGER

Points to the root element index i.e. = 0

n : INTEGER

The number of nodes (as enteredby the user)

i : INTEGER

General use int

max_height : INTEGER

The height of the tree

next_number : INTEGER

Used in the calculation of x

fl : INTEGER

Flag , used for the breaking point condition

j : INTEGER

General use int

current : INTEGER

Points to the current node index

t[n+1] : struct tree

An array of structure i.e. nodes

An example case

Right side is the terminal where you input the details, the output is seen in the left side window