#building a tree

[theimaginelly]

THUMBS UP if you liked this video, leave a COMMENT, and most importantly SUBSCRIBE for more videos!

Open me for goodies!

LAST VIDEO:

https://www.youtube.com/watch?v=cAsr7j2rDns&list=UUONq0c4mJD7q6zO_IQPH2LQ

FIND ME:

http://youtube.com/imagineworkshop

http://twitter.com/brunettemystery

http://instagram.com/imagineworkshop

http://imagineworkshop.tumblr.com

http://hiitselly.blogspot.com/

https://goodreads.com/imagineworkshop

http://younow.com/imagineworkshop

MUSIC:

incompetech.com

[expectzero-blog]

Pseudocode for Constructing a binary tree from its preorder and inorder traversal.

Lets say there is a tree as follows.                       1                 /             \             2                 3         /       \           /      \      4          5        6       7

Inorder Traversal :  4 2 5 1 6 3 7 Preorder Traversal : 1 2 4 5 3 6 7.

We will built a binary from the inorder and preorder traversal .

Lets call the function with the following parameters with the root containing the pointer to the newly created tree. root = builtTree(inorderArray,0,inorderArray.size-1,0)

Struct node { int data; node * left; node* right; }

node buildTree( int[] inorderArray, int start , int end, int pos) { if (inorderArray==null) return null; node elem = new mode(); if(start==end) { elem->data = inorderArray[pos]; return node; } else { pos = findElementInPreoder(inorderArray,start,end,pos); node->left = buildTree( inorderArray, 0, pos-1, pos++); node->right = buildTree( inorderArray, pos+1, end, pos++); } } }

int findElementInPreoder(int[] inorderArray, start,end,int pos) { for (int i = start;i<=end;i++) { if(inorderArray[i]==preorderArray[pos]) { return i; } } }

[thsfir-blog]

Day 315