Jchethana1990's Stars
Bhramari-P-shetty/hamiltonn
Bhramari-P-shetty/micro
Bhramari-P-shetty/pink-Floyd
Bhramari-P-shetty/hamilton
Amrutha-M/certification-course
Amrutha-M/Online-Coding
Apoorva-K-N/Online-courses
Certificate course and online coding
Apoorva-K-N/cgv-labprogram
ashu102/certification-day-1
Jchethana1990/prog2.c-
DJasmineJoyline/BSTSearch
Implement a C program to construct a Binary Search Tree, to search for an element in BST and to display the elements in the tree using Inorder traversals. Binary Search tree is a binary tree in which each internal node x stores an element such that the element stored in the left subtree of x are less than or equal to x and elements stored in the right subtree of x are greater than or equal to x. This is called binary-search-tree property. Input and Output Format: Refer Sample Input and Output for formatting specifications. [All text in bold corresponds to input and the rest corresponds to output] Sample Input and Output 1: Enter the element to be inserted in the tree 1 Do you want to insert another element? yes Enter the element to be inserted in the tree 2 Do you want to insert another element? yes Enter the element to be inserted in the tree 3 Do you want to insert another element? yes Enter the element to be inserted in the tree 4 Do you want to insert another element? no Inorder Traversal : The elements in the tree are 1 2 3 4 Enter the element to be searched 6 6 not found Sample Input and Output 2: Enter the element to be inserted in the tree 1 Do you want to insert another element? yes Enter the element to be inserted in the tree 2 Do you want to insert another element? yes Enter the element to be inserted in the tree 3 Do you want to insert another element? yes Enter the element to be inserted in the tree 3 Do you want to insert another element? no Inorder Traversal : The elements in the tree are 1 2 3 4 Enter the element to be searched 3 3 found
Jchethana1990/frustrated-coders
Jchethana1990/pink-floyd-and-happiness
Pink is sad because of some reasons, he wants to cheer up by listening to some songs from his favorite band, Pink Floyd. There are N records and Pink will be happy if he listens to them in the ascending order, i.e., first the song No. 1, then No.2 and so on (He has to listen to all the N songs to become Happy). Pink is delivered his records in some given order, he can either add the record to the Playlist in the delivered order or put some on another table. After being put on the table only the topmost record can be added to the playlist at any time. Print whether Pink will be sad or happy after the delivery of the records. Input Format N - Number of records followed by N numbers- order of records. Output Format Print "Happy" if the playlist has songs from 1 to N in order else "Sad".