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 …
Tag: leetcode
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. …
C++ Coding Exercise – How to Check Duplicates with Sliding Window?
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums = nums and …
How to Compare Version Numbers in C++?
Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0. You may assume that the version strings …