python Programming Inorder predecessor and successor for a given key in BST – I recently encountered with a question in an interview at e-commerce company.
PYTHON
68 Articles
68
Python Programming – Bellman Ford Algorithm – Dynamic Programming Given a graph and source vertex src in graph, find shortest paths from src to all vertices.
Python Programming – Write a function to get Nth node in a Linked List – Linked List – Write a GetNth() function that takes a linked list and an integer
Python Algorithm – Implement two stacks in an array – Data Structure – Create a data structure twoStacks that represents two stacks.
Python Algorithm – Swap nodes in a linked list without swapping data – Linked List – Given a linked list and two keys in it, swap nodes for two given keys
Python Program – Binary Tree (Introduction) – A tree whose elements have at most 2 children is called a binary tree. Let us create a simple tree with 4 node
Split a Circular Linked List into two halves – Circular Linked List Original Linked List , Result Linked List 1 , Result Linked List 2.
Python Algorithm – Find Length of a Linked List both Iterative and Recursive – Linked List – Write a C function to count number of nodes in a given singly
Python Algorithm – Evaluation of Postfix Expression – Data Structure -The Postfix notation is used to represent algebraic expressions.
Python Algorithm – Ford-Fulkerson Algorithm for Maximum Flow Problem – Given a graph which represents a flow network where every edge