上一页 1 ··· 27 28 29 30 31 32 33 34 35 ··· 37 下一页
摘要: Given a binary tree, convert it to its mirror tree. Mirror of a binary tree T is another binary tree M with the left and right children of all non-lea 阅读全文
posted @ 2017-08-10 02:42 Review->Improve 阅读(410) 评论(0) 推荐(0) 编辑
摘要: Given a singly linked list whose nodes contain an integer as their keys. All keys are distinct. Swap the node that has key x with the node that has ke 阅读全文
posted @ 2017-08-09 07:24 Review->Improve 阅读(160) 评论(0) 推荐(0) 编辑
摘要: Given a set of distinct integers, return all possible subsets. Notice Elements in a subset must be in non-descending order. The solution set must not 阅读全文
posted @ 2017-08-08 13:26 Review->Improve 阅读(230) 评论(0) 推荐(0) 编辑
摘要: Given a set of non negative integers and a target value, find if there exists a subset in the given set whose sum is target. Solution 1. Enumerate all 阅读全文
posted @ 2017-08-08 12:50 Review->Improve 阅读(487) 评论(0) 推荐(0) 编辑
摘要: Given an array, write a program to generate a random permuation of array elements. This question is also asked as "shuffle a deck of cards" or "random 阅读全文
posted @ 2017-08-08 02:48 Review->Improve 阅读(141) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, find the maximum depth or height of this tree. Solution 1. In order traversal to count the maximum depth 1 import java.util.Linke 阅读全文
posted @ 2017-08-08 02:27 Review->Improve 阅读(221) 评论(0) 推荐(0) 编辑
摘要: Given a BST whose keys are integers. Find the inorder successor and predecessor of a given key. In case the given key is not found in the BST, return 阅读全文
posted @ 2017-08-08 02:05 Review->Improve 阅读(390) 评论(0) 推荐(0) 编辑
摘要: Given some matrices, in what order you would multiply them to minimize cost of multiplication. The following problem formulation is extracted from thi 阅读全文
posted @ 2017-08-04 12:31 Review->Improve 阅读(480) 评论(0) 推荐(0) 编辑
摘要: Given a sorted array. Write a program that creates a Balanced Binary Search Tree using array elements. If there are n elements in array, then floor(n/ 阅读全文
posted @ 2017-08-04 00:45 Review->Improve 阅读(217) 评论(0) 推荐(0) 编辑
摘要: Given a Binary Tree, Print the corner nodes at each level. The node at the leftmost and the node at the rightmost. For example, output for following i 阅读全文
posted @ 2017-08-03 11:42 Review->Improve 阅读(272) 评论(0) 推荐(0) 编辑
上一页 1 ··· 27 28 29 30 31 32 33 34 35 ··· 37 下一页