二叉树
FrancisGeek的工作室
算法&设计模式
展开
-
二叉树遍历方式(非递归)
前序遍历 中序遍历 后序遍历原创 2021-04-20 18:49:13 · 72 阅读 · 0 评论 -
Same Tree
Description: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.问题描述:原创 2017-01-25 20:39:43 · 174 阅读 · 0 评论 -
Symmetric Tree
Description:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center)Ex: 1 / \ 2 2 / \ / \ 3 4 4 3 ----symmetric 1 / \ 2 2 \ \ 3原创 2017-01-25 20:52:14 · 200 阅读 · 0 评论 -
Binary Tree Level Order Traversal
Description:Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level)问题描述:按层序遍历二叉树,将每层的元素按List的形式存储。Ex:3 / \ 9 20 / \ 15 7原创 2017-01-25 21:04:08 · 139 阅读 · 0 评论 -
Maximum Depth of Binary Tree
Description: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.问题描述求二叉树的深度,二叉树的深度定义为从根结点到叶子结原创 2017-01-25 21:11:19 · 150 阅读 · 0 评论 -
Balanced Binary Tree
Description:Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node ne原创 2017-01-25 21:22:47 · 176 阅读 · 0 评论 -
Validate Binary Search Tree
Description:Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: 1.The left subtree of a node contains only nodes with keys less than the node原创 2017-02-25 21:15:13 · 266 阅读 · 0 评论 -
Subtree of Another Tree
问题描述判断一颗二叉树t是否是一颗二叉树s的 子树.分析:这种题目属于对二叉树的结构进行判断和操作的题目。注意题目说明的是判断子树问题,而不是子结构问题,也不是判断 同一颗二叉树问题. 子树—–>子结构 同一颗二叉树—–>子树——>子结构解法一:Code:public class Solution { public boolean isSubtree(TreeNode s, TreeNo原创 2017-05-07 15:03:53 · 279 阅读 · 0 评论