Java program to check if a binary tree is BST or not – A binary search tree (BST) is a node based binary tree data structure.
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
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.
C++ Programming – Count of n digit numbers whose sum of digits equals to given sum – Dynamic Programming Given two integers ‘n’ and ‘sum’, find count of all
Java Programming – Count of n digit numbers whose sum of digits equals to given sum – Dynamic Programming Given two integers ‘n’ and ‘sum’, find count
Mobile Numeric Keypad Problem – Dynamic Programming Given the mobile numeric keypad. You can only press buttons that are up, left, right or down
Minimum Cost Polygon Triangulation – Dynamic Programming A triangulation of a convex polygon is formed by drawing diagonals between non-adjacent vertices
C Programming – Count ways to reach the n’th stair – Dynamic Programming There are n stairs, a person standing at the bottom wants to reach the top.
Java Programming – Count ways to reach the n’th stair – Dynamic Programming There are n stairs, a person standing at the bottom wants to reach the top.
Boolean Parenthesization Problem – Dynamic Programming Count the number of ways we can parenthesize the expression so that the value of expression
Java Programming – Count number of binary strings without consecutive 1’s – Dynamic Programming Positive integer, count all possible distinct binary string