Traversal of trees - .. preorder(root); } Output:...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Traversal of trees -preorder -visits parent before children parent -leftchild – rightchild -postorder -visit children before parent leftchild -rightchild – parent -inorder -visit leftchild- parent- rightchild BinTree.h struct BinTreeNode{ int key; struct BinTreeNode *left; struct BinTreeNode *right; }BinTreeNode; picture 1 void preorder(BinTreeNode *node){ if(node==NULL){ return; } printf(“%d,”,node->key); preorder(node->left); preorder(node->right); } main(){ //Build tree BinTreeNode *root; root=new BinTree; root->key=. .. root->left=.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: .. preorder(root); } Output: preorder(root) 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15 void postorder(BinTreeNode *node){ if(node==NULL){ return; } postorder(node->left); postorder(node->right); printf(%d,,node->key); } Output: postorder(root) 4,5,3,7,8,6,2,11,12,10,14,15,13,9,1 void inorder(BinTreeNode *node){ if(node==NULL){ return; } inorder(node->left); printf(%d,,node->key); inorder(node->right); } Output: inorder(root); 4,3,5,2,7,6,8,1,11,10,12,9,14,13,15...
View Full Document

This note was uploaded on 02/04/2012 for the course CS 251 taught by Professor Staff during the Fall '08 term at Purdue University-West Lafayette.

Page1 / 2

Traversal of trees - .. preorder(root); } Output:...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online