Modifier and Type | Field and Description |
---|---|
TreeNode |
TreeNode.left |
TreeNode |
TreeNode.left |
TreeNode |
TreeNode.right |
TreeNode |
TreeNode.right |
Modifier and Type | Method and Description |
---|---|
static TreeNode |
TreeNode.create(int[] arr) |
static TreeNode |
TreeNode.create(int[] arr) |
Constructor and Description |
---|
TreeNode(int val,
TreeNode left,
TreeNode right) |
TreeNode(int val,
TreeNode left,
TreeNode right) |
Modifier and Type | Method and Description |
---|---|
List<Integer> |
Solution.inorderTraversal(TreeNode root) |
List<Integer> |
Solution.inorderTraversal(TreeNode root) |
void |
Solution.inorderTraversal(TreeNode root,
List<Integer> answer) |
void |
Solution.inorderTraversal(TreeNode root,
List<Integer> answer) |
Modifier and Type | Method and Description |
---|---|
List<TreeNode> |
Solution.generateTrees(int n) |
List<TreeNode> |
Solution.generateTrees(int n) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.isValidBST(TreeNode root) |
boolean |
Solution.isValidBST(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
void |
Solution.recoverTree(TreeNode root) |
void |
Solution.recoverTree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.isSameTree(TreeNode p,
TreeNode q) |
boolean |
Solution.isSameTree(TreeNode p,
TreeNode q) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.isSymmetric(TreeNode root) |
boolean |
Solution.isSymmetric(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
List<List<Integer>> |
Solution.levelOrder(TreeNode root) |
List<List<Integer>> |
Solution.levelOrder(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
List<List<Integer>> |
Solution.zigzagLevelOrder(TreeNode root) |
List<List<Integer>> |
Solution.zigzagLevelOrder(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.maxDepth(TreeNode root) |
int |
Solution.maxDepth(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.buildTree(int[] preorder,
int[] inorder) |
TreeNode |
Solution.buildTree(int[] preorder,
int[] inorder) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.buildTree(int[] inorder,
int[] postorder) |
TreeNode |
Solution.buildTree(int[] inorder,
int[] postorder) |
Modifier and Type | Method and Description |
---|---|
void |
Solution.getOrder(TreeNode root,
int level) |
void |
Solution.getOrder(TreeNode root,
int level) |
List<List<Integer>> |
Solution.levelOrderBottom(TreeNode root) |
List<List<Integer>> |
Solution.levelOrderBottom(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.makeTree(int[] num,
int left,
int right) |
TreeNode |
Solution.makeTree(int[] num,
int left,
int right) |
TreeNode |
Solution.sortedArrayToBST(int[] num) |
TreeNode |
Solution.sortedArrayToBST(int[] num) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.sortedListToBST(ListNode head) |
TreeNode |
Solution.sortedListToBST(ListNode head) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.getMaxHeight(TreeNode root) |
int |
Solution.getMaxHeight(TreeNode root) |
boolean |
Solution.isBalanced(TreeNode root) |
boolean |
Solution.isBalanced(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.minDepth(TreeNode root) |
int |
Solution.minDepth(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.hasPathSum(TreeNode root,
int sum) |
boolean |
Solution.hasPathSum(TreeNode root,
int sum) |
Modifier and Type | Method and Description |
---|---|
List<List<Integer>> |
Solution.pathSum(TreeNode root,
int targetSum) |
List<List<Integer>> |
Solution.pathSum(TreeNode root,
int targetSum) |
Modifier and Type | Method and Description |
---|---|
void |
Solution.flatten(TreeNode root) |
void |
Solution.flatten(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.findMaxPathSum(TreeNode root) |
int |
Solution.findMaxPathSum(TreeNode root) |
int |
Solution.maxPathSum(TreeNode root) |
int |
Solution.maxPathSum(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.sumNumbers(TreeNode root) |
int |
Solution.sumNumbers(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
List<Integer> |
Solution.preorderTraversal(TreeNode root) |
List<Integer> |
Solution.preorderTraversal(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
List<Integer> |
Solution.postorderTraversal(TreeNode root) |
List<Integer> |
Solution.postorderTraversal(TreeNode root) |
Constructor and Description |
---|
BSTIterator(TreeNode root) |
BSTIterator(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
List<Integer> |
Solution.rightSideView(TreeNode root) |
List<Integer> |
Solution.rightSideView(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.countNodes(TreeNode root) |
int |
Solution.countNodes(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.invertTree(TreeNode root) |
TreeNode |
Solution.invertTree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.invertTree(TreeNode root) |
TreeNode |
Solution.invertTree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.kthSmallest(TreeNode root,
int k) |
int |
Solution.kthSmallest(TreeNode root,
int k) |
Modifier and Type | Method and Description |
---|---|
List<String> |
Solution.binaryTreePaths(TreeNode root) |
List<String> |
Solution.binaryTreePaths(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Codec.deserialize(String data) |
TreeNode |
Codec.deserialize(String data) |
Modifier and Type | Method and Description |
---|---|
String |
Codec.serialize(TreeNode root) |
String |
Codec.serialize(TreeNode root) |
void |
Codec.serialize(TreeNode root,
StringBuilder sb) |
void |
Codec.serialize(TreeNode root,
StringBuilder sb) |
Copyright © 2021. All rights reserved.