无分类 leetcode讲解–872. Leaf-Similar Trees Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence.
无分类 leetcode讲解–559. Maximum Depth of N-ary Tree The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
无分类 leetcode讲解–590. N-ary Tree Postorder Traversal Given an n-ary tree, return the postorder traversal of its nodes’ values.
无分类 leetcode讲解–700. Search in a Binary Search Tree Given the root node of a binary search tree (BST) and a value. You need to find the node in the BST that the node’s value equals the given value. Return the subtree rooted with that node. If such n…
无分类 leetcode讲解–589. N-ary Tree Preorder Traversal Given an n-ary tree, return the preorder traversal of its nodes’ values.
无分类 leetcode讲解–951. Flip Equivalent Binary Trees For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees.
无分类 leetcode讲解–894. All Possible Full Binary Trees A full binary tree is a binary tree where each node has exactly 0 or 2 children.
java 红黑树插入操作的java实现 网上有非常多的关于红黑树理论的描述，本文的重点将不在于此，但是会在文中给出优秀文章的链接。对红黑树不了解的建议先阅读文章再看实现。本红黑树实现不支持多线程环境。因为删除操作灰常复杂，所以后续更新。…
