Python Program – In order Successor in Binary Search Tree – Binary Search Tree – In order Successor is NULL for the last node in In order traversal.
PYTHON
68 Articles
68
Check whether given binary tree complete not Given a Binary Tree, write a function to check whether the given Binary Tree is Complete Binary Tree or not.
Python Algorithm – Write a function to reverse a linked list – Linked List – Given pointer to the head node of a linked list, the task is to reverse
Python Algorithm – Next Greater Element – Stack – Given an array, print the Next Greater Element (NGE) for every element.
An efficient solution based on hash map is discussed. We need to check the Horizontal Distances from root for all nodes and two nodes have the same
Python Program – Lowest Common Ancestor in a Binary Search Tree – Data Structure – write a c program to find the Lowest Common Ancestor (LCA).
Python program to check if a binary tree is BST or not – Data Structure – A binary search tree is a node based binary tree data structure.
PYTHON Programming – Eulerian path and circuit for undirected graph – Eulerian Path is a path in graph that visits every edge exactly once.
Python Program – Level Order Tree Traversal – Level order traversal of a tree is breadth first traversal for the tree. There are basically two functions
PYTHON programming – Bridges in a graph – An edge in an undirected connected graph is a bridge iff removing it disconnects the graph.