Note 1

Take Note:

Take a note while surfing.

Note With Ink

Give your Note a Colorful Tag.

Easy to Access

Stay on same information and in Sync wherever you are.

Note 2

Take Note:

Organize your information,It may take Shape.

Think With Ink

Differ your Content by Color.

Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3

Take Note:

Don't Let information to miss,Because it take shape

Note With Ink

Simple an Easy Way to take a note.

Easy to Access

Get the same in next visit.

Please wait...

Program Discussion :: Trees
Home > Programs > Trees

42. Write a program to sort the elements of the tree


using namespace std;
struct Node
    int key;
    struct Node *left, *right;

/* A utility function to create a new BST Node*/
struct Node *newNode(int item)
    struct Node *temp = new Node;
    temp->key = item;
    temp->left = temp->right = NULL;
    return temp;

/* Stores inoder traversal of the BST*/
/* in arr[]*/
void storeSorted(Node *root, int arr[], int &i)
    if (root != NULL)
        storeSorted(root->left, arr, i);
        arr[i++] = root->key;
        storeSorted(root->right, arr, i);

/* A utility function to insert a new
Node with given key in BST */
Node* insert(Node* node, int key)
    /* If the tree is empty, return a new Node */
    if (node == NULL) return newNode(key);

    /* Otherwise, recur down the tree */
    if (key < node->key)
        node->left = insert(node->left, key);
    else if (key > node->key)
        node->right = insert(node->right, key);

    /* return the (unchanged) Node pointer */
    return node;

/* This function sorts arr[0..n-1] using Tree Sort
void treeSort(int arr[], int n)
    struct Node *root = NULL;

    /* Construct the BST
    root = insert(root, arr[0]);
    for (int i=1; i<n; i++)
        insert(root, arr[i]);

    /* Store inoder traversal of the BST
    /* in arr[]
    int i = 0;
    storeSorted(root, arr, i);
/* Driver Program to test above functions
int main()
    /*create input array*/
    int arr[] = {5, 4, 7, 2, 11};
    int n = sizeof(arr)/sizeof(arr[0]);
    treeSort(arr, n);
    cout << "Sorted Array : ";
    for (int i=0; i<n; i++)
    cout << arr[i] << " ";
    return 0;

Asked In ::

Post Your Answer Here:

Name *


Post Your Reply Here:


Post Your Reply Here: