41. Write a program to implement a priority queue.
42. Write a program to find the infix to postfix conversion.
43. Write a program to evaluate a postfix expression.
44. Write a program to find the infix to prefix conversion.
45. Write a program to evaluate a prefix expression.
46. Write a program to implement a binary search tree.
47. Write a program to find the height of a binary search tree.
48. Write a program to find the minimum and maximum element in a binary search tree.
49. Write a program to find the inorder, preorder, and postorder traversal of a binary search tree.
50. Write a program to find the level order traversal of a binary search tree.