Happy Codings - Programming Code Examples
Html Css Web Design Sample Codes CPlusPlus Programming Sample Codes JavaScript Programming Sample Codes C Programming Sample Codes CSharp Programming Sample Codes Java Programming Sample Codes Php Programming Sample Codes Visual Basic Programming Sample Codes

C Programming Code Examples

C > Linked Lists Code Examples

Count the Number of Occurrences of an Element in the Linked List using Recursion

Checks Character is Uppercase Lowercase - C program code to input character from user and check whether character is Uppercase or Lowercase alphabet using If Else Statement. Input a character from user. Store it in some

Find the Sum of All Nodes in a Binary Tree - Program code to find the sum of all nodes in a binary tree. Structure to create the binary tree. Inserting elements in the binary tree. C Code to dynamically create new nodes. Code

Convert Decimal to Octal in C++ language - To convert decimal number to octal number in C++ programming, you have to ask to the user to enter the decimal number to convert it into octal number to display the equivalent

Trim Leading & Trailing white spaces from - I already explained how to remove leading as well as trailing white space characters from a given string. In this program we will Combine the logic of both in a single program. Logic to

Find the First Occurrence of a Character in - C program to 'input any string' from user and find the 'first occurrence' of a given character in the string. Input string from user and store it in a variable say "str". Run a loop from start

C coding Basic binary search tree routines - Insert, swap, search value, search minimum and search maximum values. Destroy, count tree nodes. Insert a tnode into the binary tree. Traverse the tree to get a pointer to the

Concatenate 2 Strings C++ Without StrCat - Program which take Two Strings as input and concatenate Two Strings without using string class function "strcat()". There are total three strings, two for 'input' and third for our Result

C++ Generating All Subsets of a Given Set - Program print all the possible combination of each length from the given array in gray code order. The 'time complexity' of this algorithm is 'O(n*(2^n))'. This algorithm takes the input