Programmer Think

236. Nearest common ancestor of fork tree Given a binary tree, find the nearest common ancestor of two specified nodes in the tree. Baidu Encyclopedia defines the nearest public ancestor as: "for two nodes p and q with root tree T, the nearest public ancestor is expressed as a node x, which satisfies that x is the ancestor of p and q, an ...

Binary tree (linked list implementation) 1.1 basic definition of tree Tree is a very important data structure in our computer. At the same time, using this data structure can describe many things in real life, such as genealogy, organizational structure of units, and so on. A tree is a set with hierarchical relations composed of n (n > = ...

The basic operations of Binary Search Tree include search, maximum, minimum, previous, subsequent, insert and delete. The time spent on the basic operation of the binary search tree is proportional to the height of the tree. For example, for a complete binary tree with n nodes, the time complexity of the basic operation on it is O(logn). Howev ...

tree Tree is a nonlinear data structure. In the tree, each node contains its own value and its connected child nodes. The line connecting the nodes is called edge. As shown in the following figure, a is the root node and the parent node of B and C, that is, both B and C are child nodes of A. Similarly, B is the parent node of D and E, a ...

Red black tree Red black tree rule features: Nodes are red or black;The root node must be black;All leaf nodes are black and null;The two child nodes connecting the red node are black (no adjacent red nodes appear in the red black tree);Starting from any node, the path to each leaf node contains the same number of black nodes;The nodes newl ...

Title one sword refers to Offer 32 - I. print binary tree from top to bottom Source: LeetCode Link: https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/ 1. Description Each node of the binary tree is printed from top to bottom, and the nodes of the same layer are printed from left to right. 2. Examples Example 1: Given ...

Define tree nodes Define the attributes of tree nodes and the middle order traversal method class Node { int value; Node left; Node right; public Node(int value) { this.value = value; } //Medium order traversal //The result of a binary tree traversed in middle order is ordered public void infixOrder() { ...

Title Description Enter the root node root and an integer expectNumber of a binary tree to find all paths where the sum of node values in the binary tree is expectNumber. 1. The problem path is defined as the node from the root node of the tree to the leaf node (cat bin roars and prompts: pay great attention here - you must go to the leaf no ...

116. Populate the next right node pointer for each node Meaning: Given a perfect binary tree, all leaf nodes are in the same layer, and each parent node has two child nodes. Binary tree is defined as follows: struct Node { int val; Node *left; Node *right; Node *next; } Fill in each of its next pointers so that this pointer po ...

Binary tree pre, middle and post order traversal, iteration and Morris records Preorder traversal of binary tree iteration class Solution { public: vector<int> preorderTraversal(TreeNode* root) { vector<int> res; if (!root) return res; stack<TreeNode *> stk; while (root || !stk.empty()) { ...