FilesExpand file tree

master

/

树

/

Copy path

Directory actions

More options

More options

Directory actions

More options

More options

Latest commit

 

History

History

History

 

 

master

/

树

/

Copy path

Top

Folders and files

Name		Name	Last commit message	Last commit date
Morris遍历		Morris遍历
二叉搜索树		二叉搜索树
独特方法		独特方法
表达式树		表达式树
1008. Construct Binary Search Tree from Preorder Traversal.cpp		1008. Construct Binary Search Tree from Preorder Traversal.cpp
1022. Sum of Root To Leaf Binary Numbers.cpp		1022. Sum of Root To Leaf Binary Numbers.cpp
1026. Maximum Difference Between Node and Ancestor(2).cpp		1026. Maximum Difference Between Node and Ancestor(2).cpp
1026. Maximum Difference Between Node and Ancestor.cpp		1026. Maximum Difference Between Node and Ancestor.cpp
1028. Recover a Tree From Preorder Traversal.cpp		1028. Recover a Tree From Preorder Traversal.cpp
103. Binary Tree Zigzag Level Order Traversal.cpp		103. Binary Tree Zigzag Level Order Traversal.cpp
1038. Binary Search Tree to Greater Sum Tree.cpp		1038. Binary Search Tree to Greater Sum Tree.cpp
105. Construct Binary Tree from Preorder and Inorder Traversal.cpp		105. Construct Binary Tree from Preorder and Inorder Traversal.cpp
106. Construct Binary Tree from Inorder and Postorder Traversal.cpp		106. Construct Binary Tree from Inorder and Postorder Traversal.cpp
108. Convert Sorted Array to Binary Search Tree.cpp		108. Convert Sorted Array to Binary Search Tree.cpp
1080. Insufficient Nodes in Root to Leaf Paths.cpp		1080. Insufficient Nodes in Root to Leaf Paths.cpp
1090. Largest Values From Labels.cpp		1090. Largest Values From Labels.cpp
110. Balanced Binary Tree.cpp		110. Balanced Binary Tree.cpp
1104. Path In Zigzag Labelled Binary Tree.cpp		1104. Path In Zigzag Labelled Binary Tree.cpp
1110. Delete Nodes And Return Forest.cpp		1110. Delete Nodes And Return Forest.cpp
1123. Lowest Common Ancestor of Deepest Leaves.cpp		1123. Lowest Common Ancestor of Deepest Leaves.cpp
113. Path Sum II.cpp		113. Path Sum II.cpp
114. Flatten Binary Tree to Linked List.cpp		114. Flatten Binary Tree to Linked List.cpp
1145. Binary Tree Coloring Game.cpp		1145. Binary Tree Coloring Game.cpp
116. Populating Next Right Pointers in Each Node.cpp		116. Populating Next Right Pointers in Each Node.cpp
117. Populating Next Right Pointers in Each Node II.cpp		117. Populating Next Right Pointers in Each Node II.cpp
1214. Two Sum BSTs.cpp		1214. Two Sum BSTs.cpp
1245. Tree Diameter.cpp		1245. Tree Diameter.cpp
1273. Delete Tree Nodes.cpp		1273. Delete Tree Nodes.cpp
129. Sum Root to Leaf Numbers.cpp		129. Sum Root to Leaf Numbers.cpp
1302. Deepest Leaves Sum.cpp		1302. Deepest Leaves Sum.cpp
1305. All Elements in Two Binary Search Trees(2).cpp		1305. All Elements in Two Binary Search Trees(2).cpp
1305. All Elements in Two Binary Search Trees.cpp		1305. All Elements in Two Binary Search Trees.cpp
1315. Sum of Nodes with Even-Valued Grandparent.cpp		1315. Sum of Nodes with Even-Valued Grandparent.cpp
1325. Delete Leaves With a Given Value.cpp		1325. Delete Leaves With a Given Value.cpp
1339. Maximum Product of Splitted Binary Tree.cpp		1339. Maximum Product of Splitted Binary Tree.cpp
1361. Validate Binary Tree Nodes.cpp		1361. Validate Binary Tree Nodes.cpp
1367. Linked List in Binary Tree.cpp		1367. Linked List in Binary Tree.cpp
1372. Longest ZigZag Path in a Binary Tree.cpp		1372. Longest ZigZag Path in a Binary Tree.cpp
1373. Maximum Sum BST in Binary Tree.cpp		1373. Maximum Sum BST in Binary Tree.cpp
1376. Time Needed to Inform All Employees.cpp		1376. Time Needed to Inform All Employees.cpp
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree.cpp		1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree.cpp
1382. Balance a Binary Search Tree.cpp		1382. Balance a Binary Search Tree.cpp
144. Binary Tree Preorder Traversal 递归.cpp		144. Binary Tree Preorder Traversal 递归.cpp
144. Binary Tree Preorder Traversal(2).cpp		144. Binary Tree Preorder Traversal(2).cpp
1443. Minimum Time to Collect All Apples in a Tree.cpp		1443. Minimum Time to Collect All Apples in a Tree.cpp
1448. Count Good Nodes in Binary Tree.cpp		1448. Count Good Nodes in Binary Tree.cpp
145. Binary Tree Postorder Traversal(2).cpp		145. Binary Tree Postorder Traversal(2).cpp
145. Binary Tree Postorder Traversal.cpp		145. Binary Tree Postorder Traversal.cpp
1457. Pseudo-Palindromic Paths in a Binary Tree.cpp		1457. Pseudo-Palindromic Paths in a Binary Tree.cpp
1485. Clone Binary Tree With Random Pointer.cpp		1485. Clone Binary Tree With Random Pointer.cpp
1490. Clone N-ary Tree.cpp		1490. Clone N-ary Tree.cpp
1506. Find Root of N-Ary Tree(2).cpp		1506. Find Root of N-Ary Tree(2).cpp
1506. Find Root of N-Ary Tree.cpp		1506. Find Root of N-Ary Tree.cpp
1519. Number of Nodes in the Sub-Tree With the Same Label.cpp		1519. Number of Nodes in the Sub-Tree With the Same Label.cpp
1522. Diameter of N-Ary Tree.cpp		1522. Diameter of N-Ary Tree.cpp
1569. Number of Ways to Reorder Array to Get Same BST.cpp		1569. Number of Ways to Reorder Array to Get Same BST.cpp
1586. Binary Search Tree Iterator II.cpp		1586. Binary Search Tree Iterator II.cpp
1602. Find Nearest Right Node in Binary Tree.cpp		1602. Find Nearest Right Node in Binary Tree.cpp
1609. Even Odd Tree.cpp		1609. Even Odd Tree.cpp
1612. Check If Two Expression Trees are Equivalent.cpp		1612. Check If Two Expression Trees are Equivalent.cpp
1644. Lowest Common Ancestor of a Binary Tree II.cpp		1644. Lowest Common Ancestor of a Binary Tree II.cpp
1650. Lowest Common Ancestor of a Binary Tree III.cpp		1650. Lowest Common Ancestor of a Binary Tree III.cpp
1660. Correct a Binary Tree.cpp		1660. Correct a Binary Tree.cpp
1676. Lowest Common Ancestor of a Binary Tree IV.cpp		1676. Lowest Common Ancestor of a Binary Tree IV.cpp
173. Binary Search Tree Iterator.cpp		173. Binary Search Tree Iterator.cpp
1740. Find Distance in a Binary Tree.cpp		1740. Find Distance in a Binary Tree.cpp
199. Binary Tree Right Side View.cpp		199. Binary Tree Right Side View.cpp
230. Kth Smallest Element in a BST.cpp		230. Kth Smallest Element in a BST.cpp
235. Lowest Common Ancestor of a Binary Search Tree.cpp		235. Lowest Common Ancestor of a Binary Search Tree.cpp
236. Lowest Common Ancestor of a Binary Tree.cpp		236. Lowest Common Ancestor of a Binary Tree.cpp
250. Count Univalue Subtrees.cpp		250. Count Univalue Subtrees.cpp
297. Serialize and Deserialize Binary Tree.cpp		297. Serialize and Deserialize Binary Tree.cpp
298. Binary Tree Longest Consecutive Sequence.cpp		298. Binary Tree Longest Consecutive Sequence.cpp
331. Verify Preorder Serialization of a Binary Tree(2).js		331. Verify Preorder Serialization of a Binary Tree(2).js
331. Verify Preorder Serialization of a Binary Tree.js		331. Verify Preorder Serialization of a Binary Tree.js
404. Sum of Left Leaves.cpp		404. Sum of Left Leaves.cpp
428. Serialize and Deserialize N-ary Tree.cpp		428. Serialize and Deserialize N-ary Tree.cpp
437. Path Sum III.cpp		437. Path Sum III.cpp
449. Serialize and Deserialize BST.cpp		449. Serialize and Deserialize BST.cpp
450. Delete Node in a BST.cpp		450. Delete Node in a BST.cpp
508. Most Frequent Subtree Sum.cpp		508. Most Frequent Subtree Sum.cpp
515. Find Largest Value in Each Tree Row.cpp		515. Find Largest Value in Each Tree Row.cpp
536. Construct Binary Tree from String.cpp		536. Construct Binary Tree from String.cpp
538. Convert BST to Greater Tree.cpp		538. Convert BST to Greater Tree.cpp
543. Diameter of Binary Tree.cpp		543. Diameter of Binary Tree.cpp
563. Binary Tree Tilt.cpp		563. Binary Tree Tilt.cpp
582. Kill Process.cpp		582. Kill Process.cpp
589. N-ary Tree Preorder Traversal(2).cpp		589. N-ary Tree Preorder Traversal(2).cpp
589. N-ary Tree Preorder Traversal.cpp		589. N-ary Tree Preorder Traversal.cpp
590. N-ary Tree Postorder Traversal.cpp		590. N-ary Tree Postorder Traversal.cpp
617. Merge Two Binary Trees.cpp		617. Merge Two Binary Trees.cpp
623. Add One Row to Tree.cpp		623. Add One Row to Tree.cpp
652. Find Duplicate Subtrees.cpp		652. Find Duplicate Subtrees.cpp
653. Two Sum IV - Input is a BST.cpp		653. Two Sum IV - Input is a BST.cpp
654. Maximum Binary Tree.cpp		654. Maximum Binary Tree.cpp
662. Maximum Width of Binary Tree.cpp		662. Maximum Width of Binary Tree.cpp
669. Trim a Binary Search Tree.cpp		669. Trim a Binary Search Tree.cpp
687. Longest Univalue Path.cpp		687. Longest Univalue Path.cpp
701. Insert into a Binary Search Tree.cpp		701. Insert into a Binary Search Tree.cpp
814. Binary Tree Pruning.cpp		814. Binary Tree Pruning.cpp
View all files