Given a node in a binary search tree, find the in-order successor of that node in the BST. If that node has no in-order
1、題目描述 https://leetcode-cn.com/problems/symmetric-tree/ 給定一個二叉樹，檢查它是否是鏡像對稱的。 2、代碼詳解 2.1 遞歸寫法 # Definition for a binar
1、題目描述 https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/ 將一個按照升序排列的有序數組，轉換爲一棵高度平衡二叉搜索樹（BST）。
1、題目描述 https://leetcode-cn.com/problems/validate-binary-search-tree/ 給定一個二叉樹，判斷其是否是一個有效的二叉搜索樹。 2、代碼詳解 中序遍歷時，判斷當前節點是否大於
144. 二叉樹的前序遍歷 https://leetcode-cn.com/problems/binary-tree-preorder-traversal/ # Definition for a binary tree node. cl
1、題目描述 https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/ 相關題：68-1二叉搜索樹的最近公共祖先（劍）LeetCode.235 ht
1、題目描述 https://leetcode-cn.com/problems/unique-binary-search-trees/ 給定一個整數 n，求以 1 ... n 爲節點組成的二叉搜索樹有多少種？ 相關題：95. 不同的二叉
1、題目描述 https://leetcode-cn.com/problems/unique-binary-search-trees-ii/ 給定一個整數 n，生成所有由 1 ... n 爲節點所組成的 二叉搜索樹 。0 <= n <=
思路：根據先序和後序遍歷數據，遞歸的構造整棵樹 struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), lef
Path Sum Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the valu
1、題目描述 https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/ 給定一個二叉樹，找出其最大深度。 二叉樹的深度爲根節點到最遠葉子節點的最長路徑上的節點數。 說
1、題目描述 https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/ 給定一個二叉樹，找出其最小深度。 最小深度是從根節點到最近葉子節點的最短路徑上的節點數量。
Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. N
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. /** * De
【題目】 Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the defi
