- Searching in a tree: It is code on binary search in tree, which searches an element in the given tree.
- Preorder search: It is a code based preorder traversal in a tree, it first inserts the element in the tree and then prints all of them in the given tree.
- Delete Linked list: It traverse through the linked list and delete the elements in the list.
- Infix to postfix: It is code based on stack, where an infix expression is converted to postfix expression.
meshubhangi / data-structure Goto Github PK
View Code? Open in Web Editor NEWprograms of data structure