标签： 递归
-
leetcode讲解–872. Leaf-Similar Trees
Consider all the leaves of a binary tree. From left to …
-
leetcode讲解–559. Maximum Depth of N-ary Tree
The maximum depth is the number of nodes along the long…
-
leetcode讲解–590. N-ary Tree Postorder Traversal
Given an n-ary tree, return the postorder traversal of …
-
leetcode讲解–700. Search in a Binary Search Tree
Given the root node of a binary search tree (BST) and a…
-
leetcode讲解–589. N-ary Tree Preorder Traversal
Given an n-ary tree, return the preorder traversal of i…
-
leetcode讲解–951. Flip Equivalent Binary Trees
For a binary tree T, we can define a flip operation as …
-
leetcode讲解–894. All Possible Full Binary Trees
A full binary tree is a binary tree where each node has…
-
红黑树插入操作的java实现
网上有非常多的关于红黑树理论的描述，本文的重点将不在于此，但是会在文中给出优秀文章的链接。对红黑树不了解的建议…