Files

solutions
- 001.Two_Sum
- 002.Add_Two_Numbers
- 003.Longest_Substring_Without_Repeating_Characters
- 004.Median_of_Two_Sorted_Arrays
- 005.Longest_Palindromic_Substring
- 006.ZigZag_Conversion
- 007.Reverse_Integer
- 008.String_to_Integer
- 009.Palindrome_Number
- 010.Regular_Expression_Matching
- 011.Container_With_Most_Water
- 012.Integer_to_Roman
- 013.Roman_to_Integer
- 014.Longest_Common_Prefix
- 015.3Sum
- 016.3Sum_Closest
- 017.Letter_Combinations_of_a_Phone_Number
- 018.4Sum
- 019.Remove_Nth_Node_From_End_of_List
- 020.Valid_Parentheses
- 021.Merge_Two_Sorted_Lists
- 022.Generate_Parentheses
- 023.Merge_k_Sorted_Lists
- 024.Swap_Nodes_in_Pairs
- 025.Reverse_Nodes_in_k-Group
- 026.Remove_Duplicates_from_Sorted_Array
- 027.Remove_Element
- 028.Implement_strStr()
- 029.Divide_Two_Integers
- 030.Substring_with_Concatenation_of_All_Words
- 031.Next_Permutation
- 032.Longest_Valid_Parentheses
- 033.Search_in_Rotated_Sorted_Array
- 034.Search_for_a_Range
- 035.Search_Insert_Position
- 036.Valid_Sudoku
- 037.Sudoku_Solver
- 038.Count_and_Say
- 039.Combination_Sum
- 040.Combination_Sum_II
- 041.First_Missing_Positive
- 042.Trapping_Rain_Water
- 043.Multiply_Strings
- 044.Wildcard_Matching
- 045.Jump_Game_II
- 046.Permutations
- 047.Permutations_II
- 048.Rotate_Image
- 049.Anagrams
- 050.Pow(x,_n)
- 051.N-Queens
- 052.N-Queens_II
- 053.Maximum_Subarray
- 054.Spiral_Matrix
- 055.Jump_Game
- 056.Merge_Intervals
- 057.Insert_Interval
- 058.Length_of_Last_Word
- 059.Spiral_Matrix_II
- 060.Permutation_Sequence
- 061.Rotate_List
- 062.Unique_Paths
- 063.Unique_Paths_II
- 064.Minimum_Path_Sum
- 065.Valid_Number
- 066.Plus_One
- 067.Add_Binary
- 068.Text_Justification
- 069.Sqrt(x)
- 070.Climbing_Stairs
- 071.Simplify_Path
- 072.Edit_Distance
- 073.Set_Matrix_Zeroes
- 074.Search_a_2D_Matrix
- 075.Sort_Colors
- 076.Minimum_Window_Substring
- 077.Combinations
- 078.Subsets
- 079.Word_Search
- 080.Remove_Duplicates_from_Sorted_Array_II
- 081.Search_in_Rotated_Sorted_Array_II
- 082.Remove_Duplicates_from_Sorted_List_II
- 083.Remove_Duplicates_from_Sorted_List
- 084.Largest_Rectangle_in_Histogram
- 085.Maximal_Rectangle
- 086.Partition_List
- 087.Scramble_String
- 088.Merge_Sorted_Array
- 089.Gray_Code
- 090.Subsets_II
- 091.Decode_Ways
- 092.Reverse_Linked_List_II
- 093.Restore_IP_Addresses
- 094.Binary_Tree_Inorder_Traversal
- 095.Unique_Binary_Search_Trees
- 096.Unique_Binary_Search_Trees_II
- 097.Interleaving_String
- 098.Validate_Binary_Search_Tree
- 099.Recover_Binary_Search_Tree
- 100.Same_Tree
- 101.Symmetric_Tree
- 102.Binary_Tree_Level_Order_Traversal
- 103.Binary_Tree_Zigzag_Level_Order_Traversal
- 104.Maximum_Depth_of_Binary_Tree
  - AC_recursive_n.cpp
- 105.Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal
- 106.Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal
- 107.Binary_Tree_Level_Order_Traversal_II
- 108.Convert_Sorted_Array_to_Binary_Search_Tree
- 109.Convert_Sorted_List_to_Binary_Search_Tree
- 110.Balanced_Binary_Tree
- 111.Minimum_Depth_of_Binary_Tree
- 112.Path_Sum
- 113.Path_Sum_II
- 114.Flatten_Binary_Tree_to_Linked_List
- 115.Distinct_Subsequences
- 116.Populating_Next_Right_Pointers_in_Each_Node
- 117.Populating_Next_Right_Pointers_in_Each_Node_II
- 118.Pascals_Triangle
- 119.Pascal's_Triangle_II
- 120.Triangle
- 121.Best_Time_to_Buy_and_Sell_Stock
- 122.Best_Time_to_Buy_and_Sell_Stock_II
- 123.Best_Time_to_Buy_and_Sell_Stock_III
- 124.Binary_Tree_Maximum_Path_Sum
- 125.Valid_Palindrome
- 126.Word_Ladder
- 129.Sum_Root_to_Leaf_Numbers
- 130.Surrounded_Regions
- 131.Palindrome_Partitioning
- 132.Palindrome_Partitioning_II
- 133.Clone_Graph
- 134.Gas_Station
- 136.Single_Number
- 137.Single_Number_II
- 138.Copy_List_with_Random_Pointer
- 139.Word_Break
- 141.Linked_List_Cycle
- 143.Reorder_List
- 144.Binary_Tree_Preorder_Traversal
- 145.Binary_Tree_Postorder_Traversal
- 146.LRU_Cache
- 147.Insertion_Sort_List
- 148.Sort_List
- 150.Evaluate_Reverse_Polish_Notation
- 151.Reverse_Words_in_a_String
- 152.Maximum_Product_Subarray
- 153.Find_Minimum_in_Rotated_Sorted_Array
- 154.Find_Minimum_in_Rotated_Sorted_Array_II
- 155.Min_Stack
- 160.Intersection_of_Two_Linked_Lists
- 162.Find_Peak_Element
- 164.Maximum_Gap
- 165.Compare_Version_Numbers
- 166.Fraction_to_Recurring_Decimal
- 168.Excel_Sheet_Column_Title
- 169.Majority_Element
- 171.Excel_Sheet_Column_Number
- 172.Factorial_Trailing_Zeroes
- 173.Binary_Search_Tree_Iterator
- 175.Combine_Two_Tables
- 176.Second_Highest_Salary
- 177.Nth_Highest_Salary
- 178.Rank_Scores
- 179.Largest_Number
- 180.Consecutive_Numbers
- 181.Employees_Earning_More_Than_Their_Managers
- 182.Duplicate_Emails
- 183.Customers_Who_Never_Order
- 184.Department_Highest_Salary
- 187.Repeated_DNA_Sequences
- 188.Best_Time_to_Buy_and_Sell_Stock_IV
- 189.Rotate_Array
- 190.Reverse_Bits
- 191.Number_of_1_Bits
- 192.Word_Frequency
- 193.Valid_Phone_Numbers
- 194.Transpose_File
- 195.Tenth_Line
- 196.Delete_Duplicate_Emails
- 197.Rising_Temperature
- 198.House_Robber
- 199.Binary_Tree_Right_Side_View
- 200.Number_of_Islands
- 201.Bitwise_AND_of_Numbers_Range
- 202.Happy_Number
- 203.Remove_Linked_List_Elements
- 204.Count_Primes
- 205.Isomorphic_Strings
- 206.Reverse_Linked_List
- table_generator.py
.gitignore
LICENSE
readme.md
readme_generator.sh

104.Maximum_Depth_of_Binary_Tree

illuz

change tab to 4 space

Mar 20, 2015

469c1ca · Mar 20, 2015

History

This branch is 206 commits behind illuz/leetcode:master.

Name	Name	Last commit message	Last commit date
parent directory ..
AC_recursive_n.cpp	AC_recursive_n.cpp	change tab to 4 space	Mar 20, 2015

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Files

104.Maximum_Depth_of_Binary_Tree

104.Maximum_Depth_of_Binary_Tree

Files

104.Maximum_Depth_of_Binary_Tree

Directory actions

More options

Directory actions

More options

Latest commit

History

104.Maximum_Depth_of_Binary_Tree

Folders and files

parent directory