Skip to content

binary_tree

Directory actions

More options

Directory actions

More options

Latest commit

 

History

History

binary_tree

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
iteration
iteration
 
 
unified_iteration
unified_iteration
 
 
100. Same Tree.go
100. Same Tree.go
 
 
100. Same Tree_test.go
100. Same Tree_test.go
 
 
101. Symmetric Tree.go
101. Symmetric Tree.go
 
 
101. Symmetric Tree_test.go
101. Symmetric Tree_test.go
 
 
102. Binary Tree Level Order Traversal.go
102. Binary Tree Level Order Traversal.go
 
 
102. Binary Tree Level Order Traversal_test.go
102. Binary Tree Level Order Traversal_test.go
 
 
103. Binary Tree Zigzag Level Order Traversal.go
103. Binary Tree Zigzag Level Order Traversal.go
 
 
103. Binary Tree Zigzag Level Order Traversal_test.go
103. Binary Tree Zigzag Level Order Traversal_test.go
 
 
104. Maximum Depth of Binary Tree.go
104. Maximum Depth of Binary Tree.go
 
 
104. Maximum Depth of Binary Tree_test.go
104. Maximum Depth of Binary Tree_test.go
 
 
105. Construct Binary Tree from Preorder and Inorder Traversal.go
105. Construct Binary Tree from Preorder and Inorder Traversal.go
 
 
105. Construct Binary Tree from Preorder and Inorder Traversal_test.go
105. Construct Binary Tree from Preorder and Inorder Traversal_test.go
 
 
106. Construct Binary Tree from Inorder and Postorder Traversal.go
106. Construct Binary Tree from Inorder and Postorder Traversal.go
 
 
106. Construct Binary Tree from Inorder and Postorder Traversal_test.go
106. Construct Binary Tree from Inorder and Postorder Traversal_test.go
 
 
107. Binary Tree Level Order Traversal II.go
107. Binary Tree Level Order Traversal II.go
 
 
107. Binary Tree Level Order Traversal II_test.go
107. Binary Tree Level Order Traversal II_test.go
 
 
108. Convert Sorted Array to Binary Search Tree.go
108. Convert Sorted Array to Binary Search Tree.go
 
 
110. Balanced Binary Tree.go
110. Balanced Binary Tree.go
 
 
110. Balanced Binary Tree_test.go
110. Balanced Binary Tree_test.go
 
 
111. Minimum Depth of Binary Tree.go
111. Minimum Depth of Binary Tree.go
 
 
111. Minimum Depth of Binary Tree_test.go
111. Minimum Depth of Binary Tree_test.go
 
 
112. Path Sum.go
112. Path Sum.go
 
 
112. Path Sum_test.go
112. Path Sum_test.go
 
 
113. Path Sum II.go
113. Path Sum II.go
 
 
113. Path Sum II_test.go
113. Path Sum II_test.go
 
 
116. Populating Next Right Pointers in Each Node.go
116. Populating Next Right Pointers in Each Node.go
 
 
116. Populating Next Right Pointers in Each Node_test.go
116. Populating Next Right Pointers in Each Node_test.go
 
 
117. Populating Next Right Pointers in Each Node II.go
117. Populating Next Right Pointers in Each Node II.go
 
 
117. Populating Next Right Pointers in Each Node II_test.go
117. Populating Next Right Pointers in Each Node II_test.go
 
 
144. Binary Tree Preorder Traversal.go
144. Binary Tree Preorder Traversal.go
 
 
144. Binary Tree Preorder Traversal_test.go
144. Binary Tree Preorder Traversal_test.go
 
 
145. Binary Tree Postorder Traversal.go
145. Binary Tree Postorder Traversal.go
 
 
145. Binary Tree Postorder Traversal_test.go
145. Binary Tree Postorder Traversal_test.go
 
 
199. Binary Tree Right Side View.go
199. Binary Tree Right Side View.go
 
 
199. Binary Tree Right Side View_test.go
199. Binary Tree Right Side View_test.go
 
 
222. Count Complete Tree Nodes.go
222. Count Complete Tree Nodes.go
 
 
222. Count Complete Tree Nodes_test.go
222. Count Complete Tree Nodes_test.go
 
 
226. Invert Binary Tree.go
226. Invert Binary Tree.go
 
 
226. Invert Binary Tree_test.go
226. Invert Binary Tree_test.go
 
 
230. Kth Smallest Element in a BST.go
230. Kth Smallest Element in a BST.go
 
 
235. Lowest Common Ancestor of a Binary Search Tree.go
235. Lowest Common Ancestor of a Binary Search Tree.go
 
 
236. Lowest Common Ancestor of a Binary Tree.go
236. Lowest Common Ancestor of a Binary Tree.go
 
 
236. Lowest Common Ancestor of a Binary Tree_test.go
236. Lowest Common Ancestor of a Binary Tree_test.go
 
 
257. Binary Tree Paths.go
257. Binary Tree Paths.go
 
 
257. Binary Tree Paths_test.go
257. Binary Tree Paths_test.go
 
 
404. Sum of Left Leaves.go
404. Sum of Left Leaves.go
 
 
404. Sum of Left Leaves_test.go
404. Sum of Left Leaves_test.go
 
 
429. N-ary Tree Level Order Traversal.go
429. N-ary Tree Level Order Traversal.go
 
 
429. N-ary Tree Level Order Traversal_test.go
429. N-ary Tree Level Order Traversal_test.go
 
 
450. Delete Node in a BST.go
450. Delete Node in a BST.go
 
 
501. Find Mode in Binary Search Tree.go
501. Find Mode in Binary Search Tree.go
 
 
501. Find Mode in Binary Search Tree_test.go
501. Find Mode in Binary Search Tree_test.go
 
 
513. Find Bottom Left Tree Value.go
513. Find Bottom Left Tree Value.go
 
 
513. Find Bottom Left Tree Value_test.go
513. Find Bottom Left Tree Value_test.go
 
 
515. Find Largest Value in Each Tree Row.go
515. Find Largest Value in Each Tree Row.go
 
 
515. Find Largest Value in Each Tree Row_test.go
515. Find Largest Value in Each Tree Row_test.go
 
 
530. Minimum Absolute Difference in BST.go
530. Minimum Absolute Difference in BST.go
 
 
530. Minimum Absolute Difference in BST_test.go
530. Minimum Absolute Difference in BST_test.go
 
 
538. Convert BST to Greater Tree.go
538. Convert BST to Greater Tree.go
 
 
563. Binary Tree Tilt.go
563. Binary Tree Tilt.go
 
 
563. Binary Tree Tilt_test.go
563. Binary Tree Tilt_test.go
 
 
572. Subtree of Another Tree.go
572. Subtree of Another Tree.go
 
 
572. Subtree of Another Tree_test.go
572. Subtree of Another Tree_test.go
 
 
589. N-ary Tree Preorder Traversal.go
589. N-ary Tree Preorder Traversal.go
 
 
589. N-ary Tree Preorder Traversal_test.go
589. N-ary Tree Preorder Traversal_test.go
 
 
590. N-ary Tree Postorder Traversal.go
590. N-ary Tree Postorder Traversal.go
 
 
590. N-ary Tree Postorder Traversal_test.go
590. N-ary Tree Postorder Traversal_test.go
 
 
617. Merge Two Binary Trees.go
617. Merge Two Binary Trees.go
 
 
617. Merge Two Binary Trees_test.go
617. Merge Two Binary Trees_test.go
 
 
637. Average of Levels in Binary Tree.go
637. Average of Levels in Binary Tree.go
 
 
637. Average of Levels in Binary Tree_test.go
637. Average of Levels in Binary Tree_test.go
 
 
654. Maximum Binary Tree.go
654. Maximum Binary Tree.go
 
 
654. Maximum Binary Tree_test.go
654. Maximum Binary Tree_test.go
 
 
669. Trim a Binary Search Tree.go
669. Trim a Binary Search Tree.go
 
 
700. Search in a Binary Search Tree.go
700. Search in a Binary Search Tree.go
 
 
700. Search in a Binary Search Tree_test.go
700. Search in a Binary Search Tree_test.go
 
 
701. Insert into a Binary Search Tree.go
701. Insert into a Binary Search Tree.go
 
 
94. Binary Tree Inorder Traversal.go
94. Binary Tree Inorder Traversal.go
 
 
94. Binary Tree Inorder Traversal_test.go
94. Binary Tree Inorder Traversal_test.go
 
 
98. Validate Binary Search Tree.go
98. Validate Binary Search Tree.go
 
 
98. Validate Binary Search Tree_test.go
98. Validate Binary Search Tree_test.go
 
 
README.md
README.md
 
 
basic.go
basic.go
 
 

README.md

Table of Contents generated with DocToc

二叉树

最近提交时间 题目 题目难度 提交次数
19 分钟前 #538 把二叉搜索树转换为累加树 中等 2 次
1 小时前 #108 将有序数组转换为二叉搜索树 简单 3 次
1 小时前 #669 修剪二叉搜索树 中等 4 次
2 小时前 #450 删除二叉搜索树中的节点 中等 2 次
5 小时前 #701 二叉搜索树中的插入操作 中等 2 次
5 小时前 #235 二叉搜索树的最近公共祖先 简单 2 次
6 小时前 #236 二叉树的最近公共祖先 中等 1 次
12 小时前 #563 二叉树的坡度 简单 2 次
1 天前 #103 二叉树的锯齿形层序遍历 中等 1 次
1 天前 #501 二叉搜索树中的众数 简单 1 次
1 天前 #530 二叉搜索树的最小绝对差 简单 5 次
1 天前 #98 验证二叉搜索树 中等 11 次
1 天前 #700 二叉搜索树中的搜索 简单 1 次
1 天前 #513 找树左下角的值 中等 1 次
1 天前 #404 左叶子之和 简单 7 次
2 天前 #654 最大二叉树 中等 1 次
2 天前 #572 另一棵树的子树 简单 3 次
2 天前 #LCP 44 开幕式焰火 简单 1 次
2 天前 #617 合并二叉树 简单 1 次
2 天前 #113 路径总和 II 中等 1 次
2 天前 #112 路径总和 简单 1 次
3 天前 #100 相同的树 简单 3 次
3 天前 #257 二叉树的所有路径 简单 1 次
3 天前 #237 删除链表中的节点 简单 2 次
3 天前 #203 移除链表元素 简单 7 次
4 天前 #110 平衡二叉树 简单 1 次
5 天前 #106 从中序与后序遍历序列构造二叉树 中等 2 次
5 天前 #105 从前序与中序遍历序列构造二叉树 中等 1 次
5 天前 #222 完全二叉树的节点个数 中等 1 次
5 天前 #101 对称二叉树 简单 3 次
5 天前 #590 N 叉树的后序遍历 简单 3 次
5 天前 #589 N 叉树的前序遍历 简单 3 次
6 天前 #226 翻转二叉树 简单 7 次
6 天前 #94 二叉树的中序遍历 简单 8 次
6 天前 #111 二叉树的最小深度 简单 2 次
6 天前 #104 二叉树的最大深度 简单 2 次
6 天前 #117 填充每个节点的下一个右侧节点指针 II 中等 4 次
6 天前 #116 填充每个节点的下一个右侧节点指针 中等 1 次
6 天前 #515 在每个树行中找最大值 中等 2 次
6 天前 #429 N 叉树的层序遍历 中等 2 次
6 天前 #637 二叉树的层平均值 简单 2 次
6 天前 #199 二叉树的右视图 中等 1 次
6 天前 #107 二叉树的层序遍历 II 中等 1 次
6 天前 #102 二叉树的层序遍历 中等 1 次
6 天前 #144 二叉树的前序遍历 简单 5 次
6 天前 #145 二叉树的后序遍历 简单 3 次
  • 关于 leetcode 定义全局变量指针出现问题的解答
// 如果定义了全局变量 测试样例并不会每次执行完就重置清空 所以有可能存在问题
var prev *TreeNode
func getMinimumDifference(root *TreeNode) int {
    prev = nil // 或者就是每次先在入口重置一下

致谢