Files

.github
basic
img
lcci
lcof
solution
- 0000-0099
- 0100-0199
- 0200-0299
- 0300-0399
- 0400-0499
- 0500-0599
- 0600-0699
  - 0600.Non-negative Integers without Consecutive Ones
  - 0601.Human Traffic of Stadium
  - 0602.Friend Requests II Who Has the Most Friends
  - 0603.Consecutive Available Seats
  - 0604.Design Compressed String Iterator
  - 0605.Can Place Flowers
  - 0606.Construct String from Binary Tree
  - 0607.Sales Person
  - 0608.Tree Node
    - README.md
    - README_EN.md
  - 0609.Find Duplicate File in System
  - 0610.Triangle Judgement
  - 0611.Valid Triangle Number
  - 0612.Shortest Distance in a Plane
  - 0613.Shortest Distance in a Line
  - 0614.Second Degree Follower
  - 0615.Average Salary Departments VS Company
  - 0616.Add Bold Tag in String
  - 0617.Merge Two Binary Trees
  - 0618.Students Report By Geography
  - 0619.Biggest Single Number
  - 0620.Not Boring Movies
  - 0621.Task Scheduler
  - 0622.Design Circular Queue
  - 0623.Add One Row to Tree
  - 0624.Maximum Distance in Arrays
  - 0625.Minimum Factorization
  - 0626.Exchange Seats
  - 0627.Swap Salary
  - 0628.Maximum Product of Three Numbers
  - 0629.K Inverse Pairs Array
  - 0630.Course Schedule III
  - 0631.Design Excel Sum Formula
  - 0632.Smallest Range Covering Elements from K Lists
  - 0633.Sum of Square Numbers
  - 0634.Find the Derangement of An Array
  - 0635.Design Log Storage System
  - 0636.Exclusive Time of Functions
  - 0637.Average of Levels in Binary Tree
  - 0638.Shopping Offers
  - 0639.Decode Ways II
  - 0640.Solve the Equation
  - 0641.Design Circular Deque
  - 0642.Design Search Autocomplete System
  - 0643.Maximum Average Subarray I
  - 0644.Maximum Average Subarray II
  - 0645.Set Mismatch
  - 0646.Maximum Length of Pair Chain
  - 0647.Palindromic Substrings
  - 0648.Replace Words
  - 0649.Dota2 Senate
  - 0650.2 Keys Keyboard
  - 0651.4 Keys Keyboard
  - 0652.Find Duplicate Subtrees
  - 0653.Two Sum IV - Input is a BST
  - 0654.Maximum Binary Tree
  - 0655.Print Binary Tree
  - 0656.Coin Path
  - 0657.Robot Return to Origin
  - 0658.Find K Closest Elements
  - 0659.Split Array into Consecutive Subsequences
  - 0660.Remove 9
  - 0661.Image Smoother
  - 0662.Maximum Width of Binary Tree
  - 0663.Equal Tree Partition
  - 0664.Strange Printer
  - 0665.Non-decreasing Array
  - 0666.Path Sum IV
  - 0667.Beautiful Arrangement II
  - 0668.Kth Smallest Number in Multiplication Table
  - 0669.Trim a Binary Search Tree
  - 0670.Maximum Swap
  - 0671.Second Minimum Node In a Binary Tree
  - 0672.Bulb Switcher II
  - 0673.Number of Longest Increasing Subsequence
  - 0674.Longest Continuous Increasing Subsequence
  - 0675.Cut Off Trees for Golf Event
  - 0676.Implement Magic Dictionary
  - 0677.Map Sum Pairs
  - 0678.Valid Parenthesis String
  - 0679.24 Game
  - 0680.Valid Palindrome II
  - 0681.Next Closest Time
  - 0682.Baseball Game
  - 0683.K Empty Slots
  - 0684.Redundant Connection
  - 0685.Redundant Connection II
  - 0686.Repeated String Match
  - 0687.Longest Univalue Path
  - 0688.Knight Probability in Chessboard
  - 0689.Maximum Sum of 3 Non-Overlapping Subarrays
  - 0690.Employee Importance
  - 0691.Stickers to Spell Word
  - 0692.Top K Frequent Words
  - 0693.Binary Number with Alternating Bits
  - 0694.Number of Distinct Islands
  - 0695.Max Area of Island
  - 0696.Count Binary Substrings
  - 0697.Degree of an Array
  - 0698.Partition to K Equal Sum Subsets
  - 0699.Falling Squares
- 0700-0799
- 0800-0899
- 0900-0999
- 1000-1099
- 1100-1199
- 1200-1299
- 1300-1399
- 1400-1499
- 5000-5099
- README.md
- README_EN.md
- leetcode.json
- summary.md
- summary_en.md
.gitignore
LICENSE
README.md
README_EN.md
index.html
summary.md
summary_en.md

README_EN.md

History

608. Tree Node

Description

None

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Files

README_EN.md

README_EN.md

608. Tree Node

Description

Solutions

Python3

Java

...

Files

README_EN.md

Latest commit

History

README_EN.md

File metadata and controls

608. Tree Node

Description

Solutions

Python3

Java

...