Introvertuism: July 2011

Thursday, July 28, 2011

Scandal_Love Survive

Scandal kembali mengeluarkan single terbarunya,\"Love Survive\".

Berikut petikan Lyricnya:

ハリーハリー　焦る恋心
スロウリースロウリー　君を待つ時間
されど\"イイ娘\"にはなれない Naked Girl
それなら強引 Goin\' 酸いも甘いも
一切関係なしの私で
そう　ホレたハレたの勝負よ Weekend Night

そわそわとメイク直したら
唇に　ピンクのリップスティック
いつかはダーリンダーリン?
密かな想いまだ見破らないで

ABC とイロハの順序で
いったい何がわかるの?
カナリ強気　恋のカラクリ
急接近のディスティニー
恋の経験地は予測不能でしょ
「I Love You」はサバイバル
はらりはらり　一途な涙は武器になる
あと少し… 君のもとまで

日に日に　思考回路は
ロンリーロンリー　臆病になる
No! そんな女らしさはいらない
ねぇ　どうしたいの?
ねぇ　ストップ・アンド・ゴーで　夢を見るなら
もっとデッカく見なきゃね

会いたいフリ　演技じゃないけど
「Oh my ダーリン」
まだ言えないよ　そんなセリフ

3.2.1のカウントダウンで
きっと素直になれるわ
恋に落ちた　あの日の優しさ忘れない
茜空　君のカゲを探してる

もっともっともっともっともっと　声が聞きたいのに
なんで? なんで? なんで？なんで? 届かない
Oh ハリーハリー焦る恋心
桃色のロマンスを胸に秘めて

ABCとイロハの順序で
いったい何がわかるの?
カナリ強気　恋のカラクリ
急接近のディスティニー

3.2.1のカウントダウンで
きっと素直になれるわ
眩暈くらり　既に夢中
もう止められないよ

XYZ で今宵アバンチュール
もっと不埒にサバイバル
はらりはらり　一途な涙は武器になる
あと少し　さりげなく　何度でも
君のもとまで

(HARII HARII aseru koigokoro
SUROURII SUROURII kimi wo matsu jikan
Saredo \"ii ko\" ni wa narenai Naked Girl
Sore nara gouin Goin\' sui mo amai mo
Issai kankei nashi no watashi de
Sou horetahareta no shoubu yo Weekend Night

Sowasowa to MEIKU naoshitara
Kuchibiru ni PINKU no RIPPUSUTIKKU
Itsuka wa DAARIN DAARIN?
Hisokana omoi mada miyaburanai de

ABC to iroha no junjo de
Ittai nani ga wakaru no?
Kanari tsuyoki koi no karakuri
Kyuusekkin no DISUTINII
Koi no keikenchi wa yosokufunou desho
\"I Love You\" wa SABAIBARU
Harari harari ichizuna namida wa buki ni naru
Ato sukoshi kimi no moto made

Hi ni hi ni shikoukairo wa
RONRII RONRII okubyou ni naru
No! Sonna onnarashisa wa iranai
Nee doushitano?
Nee SUTOPU ANDO GOO de yume wo miru nara
Motto dekkaku minakya ne

Aitai furi engi ja nai kedo
\"Oh my DAARIN\"
Mada ienai yo sonna serifu

San-ni-ichi no KAUNTODAUN de
Kitto sunao ni nareru wa
Koi ni ochita ano hi no yasashisa wasurenai
Akanezora kimi no kage wo sagashiteru

Motto motto motto motto motto koe ga kikitai no ni
Nande? Nande? Nande? Nande? Todokanai
Oh HARII HARII aseru koigokoro
Momoiro no ROMANSU wo mune ni himete

ABC to iroha no junjo de
Ittai nani ga wakaru no?
Kanari tsuyoki koi no karakuri
Kyuusekkin no DISUTINII

San-ni-ichi no KAUNTODAUN de
Kitto sunao ni nareru wa
Memaikurari sudeni muchuu
Mou tomerarenai yo

XYZ de koyoi ABANCHUURU
Motto furachi ni SABAIBARU
Harari harari ichizuna namida wa buki ni naru
Ato sukoshi sarigenaku nandodemo
Kimi no moto made)

Translationnya sebagai berikut:

Hurry, hurry; impatient love
Slowly, slowly; the time I wait for you
Be that as it may, a \"good girl\" won\'t turn into a naked girl
If that\'s the case, then you going bittersweetly aggressive
Will have absolutely nothing to do with me
That\'s right; this game of crazy love on this Weekend Night

If I\'m nervous and fix my makeup
Putting pink lipstick on my lips
Will I someday be your darling, darling?
Don\'t look through my secret thoughts just yet

In this sequence of ABC and syllables
What exactly do you understand?
Tricks of love are quite strong
Destiny is fast approaching
Experiences of love are unpredictable, aren\'t they?
\"I Love You\" is survival
Steady, gently, gently falling tears become weapons
Just a little longer until the real you

Day by day, my patterns of thinking
Lonely, lonely; are turning into cowardice
No! I don\'t need such femininity
Hey, what\'s wrong?
Hey, in this stop and go
If you have a dream, you have to see it become bigger

I want to see you; I\'m not acting, but
\"Oh my darling\"
I still can\'t say that line

In this 3.2.1 countdown
Surely I can become honest
I fell in love; I won\'t forget your kindness that day
Searching for your shadow and that red sky

Even though I want to hear your voice more and more and more and more and more
Why? Why? Why? Why? It won\'t reach me
Oh hurry, hurry; impatient love
Our pink romance is hidden in my heart

In this sequence of ABC and syllables
What exactly do you understand?
Tricks of love are quite strong
Destiny is fast approaching

In this 3.2.1 countdown
Surely I can become honest
Dizzy, I\'m already obsessed
I can\'t stop anymore

Tonight\'s adventure in XYZ
Survival in more misconduct
Steady, gently, gently falling tears become weapons
Just a little longer, nonchalantly, over and over
Until the real you

Ini adalah single ketiganya di tahun 2011 ini dan sekaligus single ke 11-nya. Setelah \"PRIDE\" dan \"Haruka\". Semoga mereka semakin sukses dalam berkarya dan tentunya makin berjaya!

$\"scandal_-_love_survive\"$

Scandal_Love Survive

Scandal kembali mengeluarkan single terbarunya,"Love Survive".

Berikut petikan Lyricnya:

ハリーハリー　焦る恋心
スロウリースロウリー　君を待つ時間
されど"イイ娘"にはなれない Naked Girl
それなら強引 Goin' 酸いも甘いも
一切関係なしの私で
そう　ホレたハレたの勝負よ Weekend Night

そわそわとメイク直したら
唇に　ピンクのリップスティック
いつかはダーリンダーリン?
密かな想いまだ見破らないで

ABC とイロハの順序で
いったい何がわかるの?
カナリ強気　恋のカラクリ
急接近のディスティニー
恋の経験地は予測不能でしょ
「I Love You」はサバイバル
はらりはらり　一途な涙は武器になる
あと少し… 君のもとまで

日に日に　思考回路は
ロンリーロンリー　臆病になる
No! そんな女らしさはいらない
ねぇ　どうしたいの?
ねぇ　ストップ・アンド・ゴーで　夢を見るなら
もっとデッカく見なきゃね

会いたいフリ　演技じゃないけど
「Oh my ダーリン」
まだ言えないよ　そんなセリフ

3.2.1のカウントダウンで
きっと素直になれるわ
恋に落ちた　あの日の優しさ忘れない
茜空　君のカゲを探してる

もっともっともっともっともっと　声が聞きたいのに
なんで? なんで? なんで？なんで? 届かない
Oh ハリーハリー焦る恋心
桃色のロマンスを胸に秘めて

ABCとイロハの順序で
いったい何がわかるの?
カナリ強気　恋のカラクリ
急接近のディスティニー

3.2.1のカウントダウンで
きっと素直になれるわ
眩暈くらり　既に夢中
もう止められないよ

XYZ で今宵アバンチュール
もっと不埒にサバイバル
はらりはらり　一途な涙は武器になる
あと少し　さりげなく　何度でも
君のもとまで

(HARII HARII aseru koigokoro
SUROURII SUROURII kimi wo matsu jikan
Saredo "ii ko" ni wa narenai Naked Girl
Sore nara gouin Goin' sui mo amai mo
Issai kankei nashi no watashi de
Sou horetahareta no shoubu yo Weekend Night

Sowasowa to MEIKU naoshitara
Kuchibiru ni PINKU no RIPPUSUTIKKU
Itsuka wa DAARIN DAARIN?
Hisokana omoi mada miyaburanai de

ABC to iroha no junjo de
Ittai nani ga wakaru no?
Kanari tsuyoki koi no karakuri
Kyuusekkin no DISUTINII
Koi no keikenchi wa yosokufunou desho
"I Love You" wa SABAIBARU
Harari harari ichizuna namida wa buki ni naru
Ato sukoshi kimi no moto made

Hi ni hi ni shikoukairo wa
RONRII RONRII okubyou ni naru
No! Sonna onnarashisa wa iranai
Nee doushitano?
Nee SUTOPU ANDO GOO de yume wo miru nara
Motto dekkaku minakya ne

Aitai furi engi ja nai kedo
"Oh my DAARIN"
Mada ienai yo sonna serifu

San-ni-ichi no KAUNTODAUN de
Kitto sunao ni nareru wa
Koi ni ochita ano hi no yasashisa wasurenai
Akanezora kimi no kage wo sagashiteru

Motto motto motto motto motto koe ga kikitai no ni
Nande? Nande? Nande? Nande? Todokanai
Oh HARII HARII aseru koigokoro
Momoiro no ROMANSU wo mune ni himete

ABC to iroha no junjo de
Ittai nani ga wakaru no?
Kanari tsuyoki koi no karakuri
Kyuusekkin no DISUTINII

San-ni-ichi no KAUNTODAUN de
Kitto sunao ni nareru wa
Memaikurari sudeni muchuu
Mou tomerarenai yo

XYZ de koyoi ABANCHUURU
Motto furachi ni SABAIBARU
Harari harari ichizuna namida wa buki ni naru
Ato sukoshi sarigenaku nandodemo
Kimi no moto made)

Translationnya sebagai berikut:

Hurry, hurry; impatient love
Slowly, slowly; the time I wait for you
Be that as it may, a "good girl" won't turn into a naked girl
If that's the case, then you going bittersweetly aggressive
Will have absolutely nothing to do with me
That's right; this game of crazy love on this Weekend Night

If I'm nervous and fix my makeup
Putting pink lipstick on my lips
Will I someday be your darling, darling?
Don't look through my secret thoughts just yet

In this sequence of ABC and syllables
What exactly do you understand?
Tricks of love are quite strong
Destiny is fast approaching
Experiences of love are unpredictable, aren't they?
"I Love You" is survival
Steady, gently, gently falling tears become weapons
Just a little longer until the real you

Day by day, my patterns of thinking
Lonely, lonely; are turning into cowardice
No! I don't need such femininity
Hey, what's wrong?
Hey, in this stop and go
If you have a dream, you have to see it become bigger

I want to see you; I'm not acting, but
"Oh my darling"
I still can't say that line

In this 3.2.1 countdown
Surely I can become honest
I fell in love; I won't forget your kindness that day
Searching for your shadow and that red sky

Even though I want to hear your voice more and more and more and more and more
Why? Why? Why? Why? It won't reach me
Oh hurry, hurry; impatient love
Our pink romance is hidden in my heart

In this sequence of ABC and syllables
What exactly do you understand?
Tricks of love are quite strong
Destiny is fast approaching

In this 3.2.1 countdown
Surely I can become honest
Dizzy, I'm already obsessed
I can't stop anymore

Tonight's adventure in XYZ
Survival in more misconduct
Steady, gently, gently falling tears become weapons
Just a little longer, nonchalantly, over and over
Until the real you

Ini adalah single ketiganya di tahun 2011 ini.

Ramadhan ini dan Ramadhan kemarin

Sebentar lagi Ramadhan...

Apa yang telah kita lakukan pada bulan-bulan sebelumnya?Setahun sebelum itu?

Apa pula yang telah kita lakukan pada Ramadhan-Ramadhan sebelumnya?

Renungilah sahabat, apa Ramadhan ini hanya sekedar pelengkap saja? ataukah Ramadhan ini akan menjadi ajang pembersihan sebersih-bersihnya?

Yang lebih penting lagi, apakah setelah Ramadhan ini lewat,maka akan ada perubahan pada diri pribadi? Atau hanya sekadar lewat dan tidak ada perubahan yang berarti?

Akankah Ramadhan ini menjadi yang terakhir baru kita dapat bertaubat sebaik-baiknya?

Sangatlah menarik. Apa yang akan terjadi, di bulan Ramadhan ini dan setelahnya lagi....

/*Terima kasih pada my friend yang telah menyadarkanku kembali setelah banyaknya kekhilafan yang kumiliki. Hanya pertanyaan yang sepele namun sangat berarti*/

Ramadhan ini dan Ramadhan kemarin

Sebentar lagi Ramadhan...

Apa yang telah kita lakukan pada bulan-bulan sebelumnya?

Apa pula yang telah kita lakukan pada Ramadhan-Ramadhan sebelumnya?

Renungilah sahabat, apa Ramadhan ini hanya sekedar pelengkap saja? ataukah Ramadhan ini akan menjadi ajang pembersihan sebersih-bersihnya?

Height Balance Tree with coord

//compiled with Code:Block 10.05
#include<iostream>
#include<cmath>
#include<conio.h>
#include<windows.h>
using namespace std;

struct Node{
int data;
int height;
Node *left;
Node *right;};
typedef Node* ptr;

ptr Insert(int x, ptr p);
ptr findMin(ptr root);
ptr Delete(int x, ptr p);
int GetMaxDepth(ptr root, int depth);
void GoToXY(int x,int y);
void Print(ptr root,int d,int c,int swing);
ptr RotateLeft(ptr x);
ptr RotateRight(ptr x);
int BalanceFactor(ptr x);
ptr RebalanceTree(ptr x);
template<class T>
void tempStore(T* R);

int main()
{
char j = '1';
ptr Root = 0;
int h;
char in[8];
in[0] = 'C' ;
//cout<<"1.Input\n2.Delete\n Type answer : ";
do
{
cout<<"1.Input\n2.Delete\n Type answer : ";
cin>>j;
if (j == '1')
{
system("cls");
while (true)
{
system("cls");
cout<<"Enter integer number, X or x for select menu: ";
cin>>in;
if (in[0] == 'x' || in[0] == 'X')
break;
h= atoi(in);
Root = Insert(h,Root);
tempStore(Root );
getch();
}
}
else
{
if (j =='2')
{
while(true)
{
system("cls");
cout<<"Enter Value to Delete, X or x for select menu: ";
cin>>in;
if (in[0] == 'x' || in[0] == 'X')
break;
h= atoi(in);
Root = Delete(h,Root);
tempStore(Root );
getch();
system("cls");
}
}

}
}while(j>= 'a' || j<='z' || j>='A' || j<='Z' );
}

ptr Insert (int x, ptr p)
{
ptr temp;
if (!p)
{
temp = new Node;
temp->data = x;
temp->left = temp->right = 0;
temp->height= 0;
return temp;
}
else
{
if( x < p->data)
p->left=Insert(x,p->left);
else
{
if( x > p->data)
p->right=Insert(x,p->right);
}
}
p->height = BalanceFactor(p);
if (abs(p->height) >1 )
p = RebalanceTree(p);
return p;
}

ptr findMin(ptr root)
{
if (root->left)
return findMin(root->left);
else
return root;
}

ptr Delete(int x, ptr p)
{
ptr temp;
if (!p)
return 0;
else
{
if ( x > p->data)
{
temp = Delete(x,p->right);
p->right = temp;
}
else
{
if ( x < p->data)
{
temp = Delete(x,p->left);
p->left= temp;
}
else
{
if (p->left && p->right)
{
ptr swap = findMin(p->right);
p->data = swap->data;
temp = Delete(swap->data,p->right);
p->right = temp;
}
else
{
ptr a = (p->right)?p->right:p->left;
p = 0;
delete p;
return a;

}
}
}
}
p->height = BalanceFactor(p);
if (abs(p->height) >1 )
p = RebalanceTree(p);
return p;
}

int GetMaxDepth(ptr root, int depth)
{
if (!root)
return depth -1;
else
{
int a,b;
a = GetMaxDepth(root->left,depth+1);
b = GetMaxDepth(root->right,depth +1);
return (a>b)?a:b;
}
}

void GoToXY(int x,int y)
{
COORD coord;
coord.X = x ;coord.Y = y;
SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),coord);
}

void Print(ptr root,int d,int c,int swing)
{
if (root)
{
if (root->left)
{
GoToXY(swing + pow(2,d-c-1),(c+1)*2);
cout<<'|';

GoToXY(swing + pow(2,d-c-1),(c+1)*2-1);
for(int i = pow(2,d-c-1);i< pow(2,d-c);i++)
cout<<'_';
}
if (root->right)
{
GoToXY(swing + pow(2,d-c-1) + pow(2,d-c),(c+1)*2);
cout<<'|';

GoToXY(swing + pow(2,d-c-1) + pow(2,d-c),(c+1)*2-1);
for(int i = pow(2,d-c-1);i<= pow(2,d-c);i++)
{
cout<<'_';GoToXY(swing + pow(2,d-c-1) + pow(2,d-c)-(i-pow(2,d-c-1)),(c+1)*2-1);
}
}
GoToXY(swing + pow(2,d-c),(c+1)*2 -1);
cout<<root->data;
Print(root->left,d,c+1,swing);
Print(root->right,d,c+1,swing + pow(2,d-c));
}
}

ptr RotateLeft(ptr x)
{
ptr temp = x->right;
x->right = x->right->left;
temp->left = x;
return temp;
}

ptr RotateRight(ptr x)
{
ptr temp = x->left;
x->left = x->left->right;
temp->right = x;
return temp;
}

int BalanceFactor(ptr x)
{
return GetMaxDepth(x->left,1) - GetMaxDepth(x->right,1);
}
ptr RebalanceTree(ptr x)
{
if (x->height == 2)
{
if (x->left->height ==1)
return RotateRight(x);
else
{
x->left = RotateLeft(x->left);
return RotateRight(x);
}
}
else
{
if (x->right->height ==-1)
return RotateLeft(x);
else
{
x->right = RotateRight(x->right);
return RotateLeft(x);
}
}
}

template<class T>
void tempStore(T* R)
{
Print(R,GetMaxDepth(R,1),0,0);
GoToXY(0,GetMaxDepth(R,1)+1);
}

//L

//Jangan cumacopy-paste doang!!pelajari!!

//Project ini dibuat semata-mata untuk pembelajaran

Height Balance Tree with coord

Binary Search Tree with Coord

//Compiled with CodeBlock 10.05
#include<iostream>
#include<cmath>
#include<conio.h>
#include<windows.h>
#include<cstdlib>
using namespace std;

struct Node{
int data;
Node* left;
Node* right;};
typedef Node* ptr;

ptr Insert(int dat, ptr root);
ptr findMin(ptr root);
ptr Delete(int value, ptr root);
int GetMaxDepth(ptr root, int depth);
void GoToXY(int x,int y);
void Print(ptr root,int d,int c,int swing);
template<class T>
void tempStore(T* R);

int main()
{
char j = \'1\';
ptr Root = 0;
int h;
char in[8];
in[0] = \'C\' ;
//cout<<\"1.Input\\n2.Delete\\n   Type answer : \";
do
{
cout<<\"1.Input\\n2.Delete\\n Type answer : \";
cin>>j;
if (j == \'1\')
{
system(\"cls\");
while (true)
{
system(\"cls\");
cout<<\"Enter integer number, X or x for select menu: \";
cin>>in;
if (in[0] == \'x\' || in[0] == \'X\')
break;
h= atoi(in);
Root = Insert(h,Root);
tempStore(Root );
getch();
}
}
else
{
if (j ==\'2\')
{
while(true)
{
system(\"cls\");
cout<<\"Enter Value to Delete, X or x for select menu: \";
cin>>in;
if (in[0] == \'x\' || in[0] == \'X\')
break;
h= atoi(in);
Root = Delete(h,Root);
tempStore(Root );
//               cout<<\"Successfull deletion\";
getch();
system(\"cls\");
}
}

}
}while(j>= \'a\' || j<=\'z\' || j>=\'A\' || j<=\'Z\' );
return EXIT_SUCCESS;
}

ptr Insert(int dat, ptr root)
{
ptr temp1;
ptr temp2;
ptr current;
current = new Node;
current->data = dat;
current->left = NULL;
current->right = NULL;
if(root==NULL)
{
root = current;
}
else
{
temp1 = root;
while(temp1 != NULL)
{
temp2 = temp1;
if(current->data < temp1->data)
temp1 = temp1->left;
else
if(current->data > temp1->data)
temp1 = temp1->right;
else
{
//cout<<\"Duplicate value!!\";
delete current;
break;
}
}
if(temp1==NULL)
{
if(current->data<temp2->data)
temp2->left = current;
else
temp2->right = current;
}
//     cout<<\"Insert data success\";
}
return (root);
}

ptr findMin(ptr root)
{
ptr prev = root;
ptr cur = root->right;
if (root->left)
{
prev = cur;
cur = cur->left;
}
if( prev == root )
return prev->right = cur->right;
else
prev->left = cur->right;
root->data = cur->data;
delete cur;
}

int isLeft(ptr parent, ptr cur)
{
int ans;
if(parent->left == cur)
ans = 0;
else
ans=1;
return ans;
}

int isRight(ptr parent, ptr cur)
{
int ans;
if(parent->right==cur)
ans = 0;
else
ans =1;
return ans;
}

ptr Delete(int value,ptr root)
{
ptr temp1=NULL;
ptr temp2=NULL;
ptr current=NULL;
int val;
int ans;
temp1=root;
while(value!= temp1->data)
{
temp2=temp1;
if(value<temp1->data)
temp1=temp1->left;
else
temp1=temp1->right;
if(temp1==NULL)
break;
}

if(temp1==NULL)
{
//cout<<\"\\nThere is no value in Tree\";
}
else
{
current= temp1;
if(current->left==NULL && current->right==NULL)
{
//cout<<\"\\ndeleting data\"<<current->data;
if(temp2==NULL)
{
//cout<<\"\\nDeleting leaf node in tree\";
}
else
{
ans=isLeft(temp2,current);
if(ans==0)
temp2->left=NULL;
ans=isRight(temp2,current);
if(ans==0)
temp2->right=NULL;
}
delete current;
}
else
if(current->left==NULL || current->right==NULL)
{
//cout<<\"\\nDelete one node with one child: \"<<current->data;
if(current->left !=NULL)
{
if(temp2==0)
{
//   cout<<\"Delete root with one left subtree\";
root=current->left;
}
else
{
ans=isLeft(temp2,current);
if(ans==0)
temp2->left=current->left;
ans=isRight(temp2,current);
if(ans==0)
temp2->right=current->left;
}
}
if(current->right !=NULL)
{
if(temp2==0)
{
// cout<<\"\\nDelete root with right subtree\";
root=current->right;
}//end of if
else
{
ans=isLeft(temp2,current);

if(ans==0)
temp2->left=current->right;
ans=isRight(temp2,current);

if(ans==0)
temp2->right=current->right;
}
}
delete current;
}
else if(current->left!=NULL && current->right!=NULL)
{
//cout<<\"\\nDelete node with two children\";
//cout<<\"\\nMinimum value\";
temp1=current->right;
while(temp1->left !=NULL)
temp1=temp1->left;
//cout<<\"deleting and reconstruct\";
val=temp1->data;
Delete(val,root);
current->data=val;
}
}
return(root);
}

int GetMaxDepth(ptr root, int depth)
{
if (!root)
return depth -1;
else
{
int a,b;
a = GetMaxDepth(root->left,depth+1);
b = GetMaxDepth(root->right,depth +1);
return (a>b)?a:b;
}
}

void GoToXY(int x,int y)
{
COORD coord;
coord.X = x ;
coord.Y = y;
SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),coord);
}

void Print(ptr root,int d,int c,int swing)
{
if (root)
{
if (root->left)
{
GoToXY(swing + pow(2,d-c-1),(c+1)*2);
cout<<\'|\';

GoToXY(swing + pow(2,d-c-1),(c+1)*2-1);
for(int i = pow(2,d-c-1);i< pow(2,d-c);i++)
cout<<\'_\';
}
if (root->right)
{
GoToXY(swing + pow(2,d-c-1) + pow(2,d-c),(c+1)*2);
cout<<\'|\';

GoToXY(swing + pow(2,d-c-1) + pow(2,d-c),(c+1)*2-1);
for(int i = pow(2,d-c-1);i<= pow(2,d-c);i++)
{
cout<<\'_\';GoToXY(swing + pow(2,d-c-1) + pow(2,d-c)-(i-pow(2,d-c-1)),(c+1)*2-1);
}
}
GoToXY(swing + pow(2,d-c),(c+1)*2 -1);
cout<<root->data;
Print(root->left,d,c+1,swing);
Print(root->right,d,c+1,swing + pow(2,d-c));
}
}

template<class T>
void tempStore(T* R)
{
Print(R,GetMaxDepth(R,1),0,0);
GoToXY(0,GetMaxDepth(R,1)+1);
}

//L

//Jangan cuma copy-paste doang! Majukan negeri ini!!!