摘要:
Leetcode 112 路径总和 数据结构定义: /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode( 阅读全文
摘要:
Leetcode 101 数据结构定义: /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x 阅读全文
摘要:
Leetcode 104 二叉树的最大深度 数据结构定义: /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeN 阅读全文
摘要:
二叉树的层序遍历(Leetcode 102) 数据结构定义: // Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode() {} Tre 阅读全文
摘要:
二叉树的后续遍历(Leetcode 145) 数据结构定义: // Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode() {} Tre 阅读全文
摘要:
二叉树的前序遍历(Leetcode 144) 数据结构定义: // Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode() {} Tre 阅读全文
摘要:
leetcode(94 Binary Tree Inorder Traversal) 题目: Given a binary tree, return the inorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 阅读全文