二叉树
chongzi39
这个作者很懒,什么都没留下…
展开
-
leetcode 105 /106 . Construct Binary Tree
105 Construct Binary Tree from Preorder and Inorder Traversal Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tr原创 2017-10-08 18:56:49 · 188 阅读 · 0 评论 -
leetcode 100. Same Tree
Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value. 递归实现/** * De原创 2017-10-08 18:59:04 · 174 阅读 · 0 评论 -
513. Find Bottom Left Tree Value
Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Input:2/ \ 1 3Output: 1Example 2: Input: 1 / \ 2 3 / / \4 5 6 / 7Output: 7Note:原创 2017-10-08 19:02:52 · 195 阅读 · 0 评论