/DSA-solutions

Primary LanguageC

DSA-solutions

  • q1 : Write a program to create a binary tree and print using in order traversal.

  • q2 : Write a program to create a binary search tree and search an element.

  • q3 : All program will be menu drive 1. insertion 2. deletion 3. Display 4. exit

    1. Write a program to implement simple queue
    2. Write a program to implement circular queue
    3. Write a program to implement priority queue using linked list

  • q4 : Write a program to implement stack program using array.

  • q5 : Write a program to implement stack program using linked list.

  • q6 : Write a program to convert infix to postfix expression.

  • q7 : Write a program to convert infix to postfix expression.