How to Get All Binary Tree Paths in C/C++?
Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths are: Almost every tree …
How to Do Binary Tree Inorder Traversal in C/C++?
April 16, 2016
algorithms, c / c++, data structure, leetcode online judge, programming languages
No Comments
Given a binary tree, return its inorder traversal of its nodes’ values. For example: The binary tree, 1 \ 2 / 3 should return the inorder = . Recursion …
C/C++ Coding Exercise – Path Sum for Binary Tree
April 15, 2016
algorithms, c / c++, data structure, leetcode online judge, programming languages
No Comments
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. …
How to Convert Roman to Integer in C/C++ and Python?
Convert a Roman numeral value (ranged from 1 to 3999) to Arabic integer. Letter by Letter Conversion from Roman to Arabic The first few Roman numbers are: I, II, …
Compute Number of 1’s Bits in C/C++
Write a function that takes an unsigned integer and returns the number of ’1′ bits it has (also known as the Hamming weight). For example, the 32-bit integer ’11′ …
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 …