Binary search tree after the order traversal sequence
Input an array of integers to determine whether the array is the result of a binary search tree traversal. Return true if yes, false otherwise....
Read More
Tag: Binary tree
7. Data structure (PHP implementation) — the underlying implementation of the priority queue (heap)
December 15, 2023
by Joanna Edwards
No Comments
1. Description: it is based on binary tree to achieve 2. Time complexity operation time complexity in queue O(logn) out of queue O(logn)3. The floating...
Read More
LeetCode-144- Preorder traversal of a binary tree
December 14, 2023
by Wendy Haynes
No Comments
Given the root node of the binary tree, return the pre-order traversal of its node values. See the LeetCode website for an example. The copyright...
Read More
It’s Design — Why does MySQL use B+ trees?
December 14, 2023
by Kiaan Dhawan
No Comments
I believe that every background development engineer in the interview process, have been asked "MySQL's default storage engine is what? What data structure is a...
Read More
Leetcode-112 – Path Sum
December 14, 2023
by Brittany Hampton
No Comments
Given the root node of the binary tree and an integer targetSum representing the targetSum, determine if there is a path from the root node...
Read More
LeetCode-111- Minimum depth of a binary tree
December 14, 2023
by Alisha Chaudhari
No Comments
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes on the shortest path from the root node to...
Read More
LeetCode-104- Maximum depth of a binary tree
December 14, 2023
by Gabriel Washington
No Comments
Given a binary tree, find its maximum depth. The depth of the binary tree is the number of nodes along the longest path from the...
Read More
Leetcode-101 – Symmetric Binary Trees
December 14, 2023
by 周佳樺
No Comments
Given a binary tree, check if it is mirror symmetric. See the LeetCode website for an example. The copyright belongs to Lankou Network. Commercial reprint...
Read More
Leetcode-094 – Intermediate order traversal of a binary tree
December 14, 2023
by Bridget Johnson
No Comments
Given the root node of a binary tree, return its middle order traversal. See the LeetCode website for an example. The copyright belongs to Lankou...
Read More
LeetCode-100- Same tree
December 14, 2023
by Dr. Charlie Black
No Comments
Description: Given the root nodes p and q of two binary trees, write a function to check whether the two trees are the same. Two...
Read More