// binarytree.cpp: Define the entry point of the console application.
// # include "stdafx.h" #include struct node {int value; int right; int} Tree [15]; void inorder (int root) {if (Tree [root] .left! = -1) Inorder (Tree [root] .left; printf ("% d", tree [root] .value); if (Tree [root] .right! = - 1) inorder (Tree [root] .right } void preorder (int root) {Printf ("% D", Tree [root] .value); if (Tree [root] .left! = - 1) preorder (Tree [root] .left); IF Tree [root] .right! = - 1) preorder (Tree [root] .right);} void postorder (int root) {if (Tree [root] .left! = - 1) Postorder (Tree [root] .left ); If (Tree [root] .right! = - 1) Postorder (Tree [root] .left); Printf ("% D", Tree [root] .value);} main () {/ * first to initalized The Matrix of the Tree * / for (INT i = 0; i <15; i ) {Tree [i] .value = i;} Tree [0] .left = 1; Tree [0] .right = 2; Tree [1] .left = 3; Tree [1] .right = 4; Tree [2] .left = 5; Tree [2] .right = 6; Tree [3] .left = 7; Tree [3] .right = 8; Tree [4] .left = -1; Tree [4] .right = -1; Tree [5] .right = 9; Tree [5] .right = 10; Tree [6] .left = 11; Tree [6] .right = 12; Tree [7] .right = 13; Tree [7] .right = 14; Tree [8] .right = -1; tree [8] .right = -1; tree [9 ] .left = -1; Tree [9] .right = -1; Tree [10] .right = -1; Tree [10] .right = -1; tree [11] .right = -1; tree [11] .right = -1; Tree [12] .right = -1; Tree [12] .right = -1; Tree [13] .left = -1; Tree [13] .right = -1; Tree [14] .left = -1; Tree [14] .right = -1; / * The order functions area put here !!!!!!!!!!!! * / printf ("Copyrights by fish& sehome ========== ===================> Use it it is, "" this is preorder's result: / n "); preorder (0); Printf (" / n ") ;
