Click here to Skip to main content
11,580,926 members (65,704 online)
Click here to Skip to main content
Add your own
alternative version

Tagged as

C++ binary tree problem

, 30 Dec 2012 CPOL 895
#includeusing namespace std;struct treeNode{ int indexI,indexJ; treeNode *Right,*Down;};treeNode*Try(int i,int j,int n,int x=0);void preorderPrint( treeNode *root );int**Array;void read(int**A,int n){ for(int i=0;i for(int...

Revisions


  

Compare Revision Minor Date Status Editor
3 - publicly available Yes 30-Dec-12 13:32 Available André Kraak
Removed pleading
2 No 30-Dec-12 13:31 Available André Kraak
Added code tags
1 No 30-Dec-12 13:15 Available Ali++paco#

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

Ali++paco#
United States United States
No Biography provided

You may also be interested in...

| Advertise | Privacy | Terms of Use | Mobile
Web04 | 2.8.150603.1 | Last Updated 30 Dec 2012
Article Copyright 2012 by Ali++paco#
Everything else Copyright © CodeProject, 1999-2015
Layout: fixed | fluid