ZWB626的博客

package leetcode;/*Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which represents the number12...

Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2 1 \ ...

package leetcode;public class Balanced_binary_tree {     public static void main(String[] args) {            }          public boolean isBalanced(TreeNode root) {         if(root == null) {  ...

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,20,#,#,15,7}, 3 / \ 9 20 / \...

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).For example:Given binary tre...

Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n ) space is pretty straight forward. Could you devise a ...

package niuke.day1;Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than ...

Given inorder and postorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree.package leetcode;public class Construct_binary_tree_from...

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown below. 1 3 ...

Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value. package lee...

Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to its next right node. If...

package leetcode;/*Given a binary tree, return the preorder traversal of its nodes' values*/import java.util.ArrayList;public class Binary_tree_preorder_traversal {      public static void main...

package leetcode;/*Given a binary tree, return the postorder traversal of its nodes' values.*/import java.util.ArrayList;public class Binary_tree_postorder_traversal {     public static void mai...

package niuke.day1;import java.util.Stack;/*Given a binary tree and a sum, determine if the tree has a root-to-leaf path suchthat adding up all the values along the path equals the given sum.For ...

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3 But the follo...

Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution still work?Note:You may only use constant extra ...

package niuke.day1;import java.util.ArrayList;import java.util.LinkedList;import java.util.Queue;import java.util.Stack;public class Binary_tree_level_order_traversal_ii {      public static v...

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum = 22, 5 / \ ...

package leetcode;/*Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.*/public class M...

package eighty;public class Onefiveeight {    public static void main(String[] args) {        int[] a = {1,43,23,56,76,23,12,3,76,345,9,21};        int N = a.length;        boolean flag = false;...