Commit 775af6d

committed

program to check digits in 2 numbers

1 parent af1f6eb commit 775af6dCopy full SHA for 775af6d

File tree

+68

-1

lines changed

+68

-1

lines changed

Lines changed: 34 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -127,6 +127,36 @@ void BottomView(Node *root)`
`127`	`127`	`}`
`128`	`128`
`129`	`129`
	`130`	`+void UtilBottomView(Node *root,map<int,vector<int> >&m,int hd=0)`
	`131`	`+{`
	`132`	`+ if(!root) return;`
	`133`	`+`
	`134`	`+ UtilBottomView(root->left,m,hd-1);`
	`135`	`+`
	`136`	`+ m[hd].push_back(root->data);`
	`137`	`+`
	`138`	`+ UtilBottomView(root->right,m,hd+1);`
	`139`	`+`
	`140`	`+}`
	`141`	`+void bottomView(Node *root)`
	`142`	`+{`
	`143`	`+`
	`144`	`+ map<int,vector<int> >m;`
	`145`	`+ map<int,vector<int> >::iterator it;`
	`146`	`+ //populating the map`
	`147`	`+ UtilBottomView(root,m);`
	`148`	`+`
	`149`	`+ for(it = m.begin();it != m.end();it++)`
	`150`	`+ {`
	`151`	`+`
	`152`	`+ int j = it->second.size()-1;`
	`153`	`+`
	`154`	`+ cout<<it->second[j]<<" ";`
	`155`	`+`
	`156`	`+ }`
	`157`	`+`
	`158`	`+}`
	`159`	`+`
`130`	`160`	`int main()`
`131`	`161`	`{`
`132`	`162`	`Node *root = newNode(20);`
`@@ -138,5 +168,8 @@ int main()`
`138`	`168`	`root->left->right->right = newNode(14);`
`139`	`169`	`root->right->right = newNode(25);`
`140`	`170`
`141`		`- BottomViewMap(root);`
	`171`	`+ BottomView(root);`
	`172`	`+ cout<<endl;`
	`173`	`+`
	`174`	`+ bottomView(root);`
`142`	`175`	`}`

Lines changed: 34 additions & 0 deletions

Comments

(0)