How to Validate Binary Search Tree in C/C++?
Given a binary tree root, return whether it’s a binary search tree. A binary tree node is a binary search tree if : All nodes on its left subtree …
Category: Recursion
How to Check Symmetric Tree in C++ (Iterative and Recursion)?
Given a binary tree, you are asked to check whether it is a mirror of itself (i.e, symmetric around its center): https://leetcode.com/problems/symmetric-tree/ For example, this binary tree is symmetric: …
How to Maxmize Profits to Robbering in a Binary Tree using Dynamic Programming Algorithm?
March 16, 2016
algorithms, Binary Tree, c / c++, Depth First Search, DFS, Dynamic Programming, dynamic programming, Memoization, Recursion
No Comments
The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the root, each house has …
Using the Dynamic Programming Algorithm, the Depth First Search or Breadth First Search to Solve House Robber Problem (Largest Sum of Non-Adjacent Numbers)
April 15, 2015
algorithms, BFS, Breadth First Search, c / c++, Depth First Search, DFS, Dynamic Programming, dynamic programming, Memoization, python, Recursion
3 Comments
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each …
A Recursive Full Permutation Algorithm in Python
The full permutation of a list can be easily programmed using recursive algorithms. The number of the full permutation results is where is the number of elements to permutate. …