LeetCode tree二叉树的相关内容

[LeetCode] Verify Preorder Serialization of a Binary Tree 验证二叉树的先序序列化

One way to serialize a binary tree is to use pre-oder traversal. When we encounter a non-null node, we record the node's value. If it is a null node, ...

[LeetCode] Binary Tree Zigzag Level Order Traversal 二叉树的之字形层序遍历

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next ...

leetCode 257. Binary Tree Paths 二叉树路径

257. Binary Tree Paths Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 /&n...

[LeetCode] Add One Row to Tree 二叉树中增加一行

Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth&nbs...

共有4条

< 1 >

跳转至： GO

更新时间 2024-02-21 16:34:52

本页面内关键词为智能算法引擎基于机器学习所生成，如有任何问题，可在页面下方点击"联系我们"与我们沟通。

社区圈子

算法编程

开发者社区在线编程频道官方技术圈。包含算法资源更新，周赛动态，每日一题互动。

[LeetCode] Verify Preorder Serialization of a Binary Tree 验证二叉树的先序序列化

[LeetCode] Binary Tree Zigzag Level Order Traversal 二叉树的之字形层序遍历

leetCode 257. Binary Tree Paths 二叉树路径

[LeetCode] Add One Row to Tree 二叉树中增加一行

LeetCode二叉树相关内容

LeetCode更多二叉树相关

LeetCode您可能感兴趣