sorry if i posted in wrong forum.pls forgive me


pls tell how to find bfs successor of a node in a tree(BST and binary tree)

use a dp solution
#include<iostream.h>
#include<string.h>
#include<vector.h>
#include<iterator.h>
int main()
{
vector<long long int>v1(101);
vector<long long int>v2(101);
int i=0;

also use getch();
include<conio.h>

could somebody tell wats wrong with this
#define FOR(x,n)for(typeof(x);x<n;x++)