PROGRAM FOR BINARY SEARCHING IN TREES using RECURSION.

PROGRAM FOR BINARY SEARCHING IN TREES using RECURSION.

  7:29 PM    Unknown

---

#include <iostream> #include <conio.h> #include <stdlib.h> using namespace std; class B_Tree; class Node { private:     int Info;     Node *Left, *Right;     friend class B_Tree; }; class B_Tree { private:     Node *Root; public:     B_Tree()     {         Root = NULL;     }  ...

Read More

PROGRAM TO COUNT SUM OF ALL NODES using RECURSION.

PROGRAM TO COUNT SUM OF ALL NODES using RECURSION.

  7:26 PM    Unknown

---

#include <iostream> #include <conio.h> #include <stdlib.h> using namespace std; class B_Tree; class Node { private:     int Info;     Node *Left, *Right;     friend class B_Tree; }; class B_Tree { private:     Node *Root; public:     B_Tree()     {         Root = NULL;     }  ...

Read More

PROGRAM FOR SORTING ARRAY USING QUICK SORT.

PROGRAM FOR SORTING ARRAY USING QUICK SORT.

  7:22 PM    Unknown

---

#include <iostream> #include <conio.h> using namespace std; class Array { private: int *Arr, Size, Right; public: Array(int Siz) { Arr = new int[Siz]; for (int I = 0; I <Siz; I++) Arr[I] = 0; Right = 0; Size = Siz; } void Input() { int No; cout << "Enter Size Of Array: "; cin >> No; Right = No; cout << "\nEnter Elements Of Array:...

Read More

PROGRAM FOR SORTING ARRAY USING MERGE SORT.

PROGRAM FOR SORTING ARRAY USING MERGE SORT.

  7:20 PM    Unknown

---

#include <iostream> #include <conio.h> using namespace std; class Array { private: int *Arr, Size, Right; public: Array(int Siz) { Arr = new int[Siz]; for (int I = 0; I <Siz; I++) { Arr[I] = 0; } Right = 0; Size = Siz; } void Input() { int No; cout << "Enter Size Of Array: "; cin >> No; Right = No; cout << "\nEnter Elements...

Read More

PROGRAM TO IMPLEMENT INORDER TRAVERSAL using STACK.

PROGRAM TO IMPLEMENT INORDER TRAVERSAL using STACK.

  4:09 PM    Unknown

---

#include <iostream> #include <stdlib.h> #include <conio.h> using namespace std; class Node; class B_Tree; template <class Type> class Stack { private: Type *Arr; int Top, Size; public: Stack(int Siz) { Size = Siz; Arr = new Type[Size]; for (int I = 0; I <Size; I++) { Arr[I] = 0; } Top = -1; } void Push(Type Num) { if (Top == Size - 1) ...

Read More

PROGRAM TO IMPLEMENT THE TREE TRAVERSELS.

PROGRAM TO IMPLEMENT THE TREE TRAVERSELS.

  1:16 PM    Unknown

---

#include <iostream> #include <conio.h> #include <stdlib.h> using namespace std; class B_Tree; class Node { private:     int Info;     Node *Left, *Right;     friend class B_Tree; }; class B_Tree { private:     Node *Root; public:     B_Tree()     {         Root = NULL;     }  ...

Read More

PROGRAM TO IMPLEMENT THE DOUBLY LINKLIST.

PROGRAM TO IMPLEMENT THE DOUBLY LINKLIST.

  1:13 PM    Unknown

---

#include <iostream> #include <stdlib.h> #include <conio.h> using namespace std; class Double_LL; class Node { private:     int Info;     Node *Left, *Right;     friend class Double_LL; }; class Double_LL { private:     Node *First; public:     Double_LL()     {         First = NULL;    ...

Read More