1. Why do you need a tree data structure?
Analysis of array storage mode
Advantages: it is fast to access elements by subscript. For ordered arrays, binary search can also be used to improve the retrieval speed.Disadvantages: if a specific value is to be retrieved, or the inserted value (in a certain order) will move as a whole, the eff ...
Posted by biffjo on Sat, 23 Oct 2021 22:15:29 -0700
110.Balanced Binary Tree-Force Button (LeetCode)
Release: October 10, 2021 21:30:53
Problem description and examples
Given a binary tree, determine whether it is a highly balanced binary tree. In this topic, a height-balanced binary tree is defined as: The absolute difference between the left and right subtrees of each node of a binary tr ...
Posted by lox on Sun, 10 Oct 2021 10:19:23 -0700
Our previous studies are basically one-to-one problems, and the tree is a nonlinear data structure, which is a finite set with hierarchical relationship composed of n(n ≥ 0) nodes
characteristic: When n=0, it is called an empty tree. In any non empty tree:
There is and only one root nodeWhen n > 1, the other nodes ca ...
Posted by Deviants on Thu, 07 Oct 2021 16:01:24 -0700
Non recursive postorder traversal of binary tree
1. Using 1 stack
O(n) time, O(n) space The initial setting stack is empty, and the current node is the root node
Perform the following operations until the stack is empty and the current node is empty:
Stack the current node and set the left child as the current node until the current node is ...
Posted by Michael_zz on Sat, 25 Sep 2021 04:12:40 -0700
1, Zuo gaoshu
The heap structure learned earlier is an implicit data structure. The heap represented by a complete binary tree is stored implicitly in an array (i.e. no explicit pointer or other data can be used to reshape this structure). Because there is no storage structure information, this representation method has high space utilizat ...
Posted by Kower on Sat, 18 Sep 2021 09:08:34 -0700