Skip to content

Instantly share code, notes, and snippets.

View kanrourou's full-sized avatar

Ke Xu kanrourou

6 followers · 2 following
View GitHub Profile
@kanrourou
kanrourou / Morris inorder.java
Created January 6, 2015 04:01
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
@kanrourou
kanrourou / Morris postorder.java
Created January 6, 2015 04:10
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
@kanrourou
kanrourou / binary tree iterator.java
Created January 6, 2015 05:29
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
@kanrourou
kanrourou / validate binary search tree.java
Created January 6, 2015 05:52
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
@kanrourou
kanrourou / same tree.java
Created January 6, 2015 06:06
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
@kanrourou
kanrourou / symmetric tree.java
Created January 6, 2015 06:07
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
@kanrourou
kanrourou / BST.java
Last active August 29, 2015 14:12
public class BST<Key extends Comparable<Key>, Value> {
private class Node {
private Key key;
private Value value;
private int count;
private Node left, right;
public Node(Key key, Value value) {
this.key = key;
@kanrourou
kanrourou / atoi.java
Created January 7, 2015 22:04
public class Solution {
public int atoi(String str) {
if(str == null)
return 0;
int len = str.length();
if (len == 0)
return 0;
int start = 0;
boolean isNeg = false;
while (start < len && str.charAt(start) == ' ')
@kanrourou
kanrourou / BST insertion recursion.java
Created January 7, 2015 22:12
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
@kanrourou
kanrourou / BST delete.java
Created January 8, 2015 00:27
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }