draw binary tree online

Title: Please complete a function, enter a binary tree, the function output its image. as shown in the following illustration: The two fork tree on the right is the mirror of the tree on the left. We can draw a mirror image based on the experience in the mirror. recursive th

This is a more classic topic. I first in Baidu's online written test, and then found that the sword refers to the original question on offer. Of course, the topic is not exactly the same but roughly the same.Baidu written test is to give you two root node to determine whether the first tree is the subtree. The point of the sword is to ask whether the second number is the substructure of the first

Time limit:1 second Memory limit:32 MB Special Judgment:No Submit:31 Solution:19 tags Binary tree traversal Description Binary Tree pre-order, middle-order, and post-order traversal definitions:Forward traversal: For any subtree, first access the heel, then traverse its left subtree, and finally traverse its right s

title :Implement an iterator over a binary search tree (BST). Your iterator is initialized with the root node of a BST.Calling would return the next smallest number in the next() BST.Note: next() hasNext() and should run in average O (1) time and uses O (h) memory, where H is the height of the Tree.Ideas:To achieve the iterator of a two-fork search tree, find the

node is located (without the root node)list, index); Root.left=gettheroot (Startpreorder, Startinorder, index); } //If index > 0, it indicates that there is currently a subtree if(Index ) {List), count); List), count); //Why is count-index-1 here? You can draw some thought .Root.right = Gettheroot (Endpreorder, Endinorder, (count-index-1)); } returnRoot; }SummarizeFirst, we should be familiar with the

introduction of the lack of the shortest path and no right to the longest simple path analysis, back to the reality, is also a good understanding of the case explained that the longest simple path of the sub-problem is not independent, can not be used to solve the dynamic programming method. The shortest path is not said, the longest problem is decomposed into sub-problems, obviously on a graph node is not independent.It is more practical to use dynamic programming method to find the longest co

Original site: http://blog.csdn.net/Quack_quack/article/details/46958413Title: Give n number w[], representing the number of times n letters appear, give K. The K-binary string si is required to replace the letter I, and replaced after the replacement of the article has no ambiguity (the ambiguity here refers to any of the 1≤i,j≤n, I≠j, there are: Si is not the prefix of SJ), to replace the shortest post length (length Len=sigma (w[i]* Strlen (SI))) a

Hdu 5444 Elven Postman (Changchun cyber competition-balanced binary tree traversal)Elven PostmanTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission (s): 1206 Accepted Submission (s): 681Problem DescriptionElves are very peculiar creatures. as we all know, they can live for a very long time and their magical prowess are not something to be taken lightly. also,

Reference: "The Sword refers to offer" Commemorative editionScenario 1: Gives the sequence of the sequence of the first sequence of the tree, and the sequence of sequential output.Case 2: Give the sequence and sequence of the order of the tree, and output the sequence of pre-orderWorkaround: Based on the given two sequences, the binary

Analysis Easy to use Source Https://leetcode.com/problems/maximum-depth-of-binary-tree/ Question Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Note:A leaf is a node with no children. Example: Given

Leetcode 236 Lowest Common Ancestor of a Binary Tree, leetcodeancestor1. Problem Description Given a binary tree and two nodes p and q, find the closest public parent node of the two nodes.　　2. methods and ideas Given a common Binary Tre