Algorithm Algo Create Binary Tree INPUT: ROOT IS POINTER TO THE ROOT NODE OF THE TREE OUTPUT: ELEMENTS OF BINARY TREEDATA STRUCTURE: BINARY TREE USING LINKEDLIST Algo Preorder Algo Inorder Algo Postorder Code Output
Binary Tree Inorder , Preorder , Postorder Traversal Read More »
Algorithm INPUT: FRONT IS A POINTER WHICH IS USED TO POINT TO THE ELEMENT FROM WHERE DELETION OF ELEMENT TAKES PLACE AND THE ELEMENT TO BE ENQUEUE AND REAR IS A POINTER WHICH POINTS TO THE ELEMENT FROM WHERE INSERTION TAKES PLACEOUTPUT: STACK AFTER PUSH OPERATIONDATA STRUCTURE: STACK USING ARRAY Algo Enqueue Algo Dequeue Code
Algorithm INPUT: HEADER is a pointer to the header node of the linkedlistOUTPUT: Prints the elements of the stack after operationDATA STRUCTURE: Stack using Singly Linkedlist Algo Push Algo Pop Code Output
Algorithm INPUT: TOP POINTER WHICH IS USED TO POINT TO THE TOP OF THE STACK OUTPUT: STACK AFTER POP OPERATIONDATA STRUCTURE: STACK USING ARRAY Code Output
Algorithm INPUT: TOP POINTER WHICH IS USED TO POINT TO THE TOP OF THE STACK AND THE ELEMENT TO BE PUSHOUTPUT: STACK AFTER PUSH OPERATIONDATA STRUCTURE: STACK USING ARRAY Code Output
