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(List<Integer> treeValues) |
static TreeNode |
TreeNode.create(List<Integer> treeValues) |
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.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 |
---|---|
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.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 |
---|---|
TreeNode |
Solution.lowestCommonAncestor(TreeNode root,
TreeNode p,
TreeNode q) |
TreeNode |
Solution.lowestCommonAncestor(TreeNode root,
TreeNode p,
TreeNode q) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.lowestCommonAncestor(TreeNode root,
TreeNode p,
TreeNode q) |
TreeNode |
Solution.lowestCommonAncestor(TreeNode root,
TreeNode p,
TreeNode q) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.lowestCommonAncestor(TreeNode root,
TreeNode p,
TreeNode q) |
TreeNode |
Solution.lowestCommonAncestor(TreeNode root,
TreeNode p,
TreeNode q) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.lowestCommonAncestor(TreeNode root,
TreeNode p,
TreeNode q) |
TreeNode |
Solution.lowestCommonAncestor(TreeNode root,
TreeNode p,
TreeNode q) |
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) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.rob(TreeNode root) |
int |
Solution.rob(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.sumOfLeftLeaves(TreeNode root) |
int |
Solution.sumOfLeftLeaves(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
void |
Solution.helper(TreeNode node,
int targetSum,
long currSum) |
void |
Solution.helper(TreeNode node,
int targetSum,
long currSum) |
int |
Solution.pathSum(TreeNode root,
int targetSum) |
int |
Solution.pathSum(TreeNode root,
int targetSum) |
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) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.deleteNode(TreeNode root,
int key) |
TreeNode |
Solution.deleteNode(TreeNode root,
int key) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.deleteNode(TreeNode root,
int key) |
TreeNode |
Solution.deleteNode(TreeNode root,
int key) |
Modifier and Type | Method and Description |
---|---|
int[] |
Solution.findMode(TreeNode root) |
int[] |
Solution.findMode(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int[] |
Solution.findFrequentTreeSum(TreeNode root) |
int[] |
Solution.findFrequentTreeSum(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.findBottomLeftValue(TreeNode root) |
int |
Solution.findBottomLeftValue(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
List<Integer> |
Solution.largestValues(TreeNode root) |
List<Integer> |
Solution.largestValues(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.getMinimumDifference(TreeNode root) |
int |
Solution.getMinimumDifference(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.convertBST(TreeNode root) |
TreeNode |
Solution.convertBST(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.convertBST(TreeNode root) |
TreeNode |
Solution.convertBST(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.diameterOfBinaryTree(TreeNode root) |
int |
Solution.diameterOfBinaryTree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.findTilt(TreeNode root) |
int |
Solution.findTilt(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.isSubtree(TreeNode root,
TreeNode subRoot) |
boolean |
Solution.isSubtree(TreeNode root,
TreeNode subRoot) |
Modifier and Type | Method and Description |
---|---|
String |
Solution.tree2str(TreeNode t) |
String |
Solution.tree2str(TreeNode t) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.mergeTrees(TreeNode root1,
TreeNode root2) |
TreeNode |
Solution.mergeTrees(TreeNode root1,
TreeNode root2) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.mergeTrees(TreeNode root1,
TreeNode root2) |
TreeNode |
Solution.mergeTrees(TreeNode root1,
TreeNode root2) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.addOneRow(TreeNode root,
int val,
int depth) |
TreeNode |
Solution.addOneRow(TreeNode root,
int val,
int depth) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.addOneRow(TreeNode root,
int val,
int depth) |
TreeNode |
Solution.addOneRow(TreeNode root,
int val,
int depth) |
Modifier and Type | Method and Description |
---|---|
List<Double> |
Solution.averageOfLevels(TreeNode root) |
List<Double> |
Solution.averageOfLevels(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
List<TreeNode> |
Solution.findDuplicateSubtrees(TreeNode root) |
List<TreeNode> |
Solution.findDuplicateSubtrees(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
List<TreeNode> |
Solution.findDuplicateSubtrees(TreeNode root) |
List<TreeNode> |
Solution.findDuplicateSubtrees(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.findTarget(TreeNode root,
int k) |
boolean |
Solution.findTarget(TreeNode root,
int k) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.constructMaximumBinaryTree(int[] nums) |
TreeNode |
Solution.constructMaximumBinaryTree(int[] nums) |
Modifier and Type | Method and Description |
---|---|
List<List<String>> |
Solution.printTree(TreeNode root) |
List<List<String>> |
Solution.printTree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.widthOfBinaryTree(TreeNode root) |
int |
Solution.widthOfBinaryTree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.trimBST(TreeNode root,
int l,
int r) |
TreeNode |
Solution.trimBST(TreeNode root,
int l,
int r) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.trimBST(TreeNode root,
int l,
int r) |
TreeNode |
Solution.trimBST(TreeNode root,
int l,
int r) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.findSecondMinimumValue(TreeNode root) |
int |
Solution.findSecondMinimumValue(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.longestUnivaluePath(TreeNode root) |
int |
Solution.longestUnivaluePath(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.searchBST(TreeNode root,
int val) |
TreeNode |
Solution.searchBST(TreeNode root,
int val) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.searchBST(TreeNode root,
int val) |
TreeNode |
Solution.searchBST(TreeNode root,
int val) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.insertIntoBST(TreeNode root,
int val) |
TreeNode |
Solution.insertIntoBST(TreeNode root,
int val) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.insertIntoBST(TreeNode root,
int val) |
TreeNode |
Solution.insertIntoBST(TreeNode root,
int val) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.minDiffInBST(TreeNode root) |
int |
Solution.minDiffInBST(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.pruneTree(TreeNode root) |
TreeNode |
Solution.pruneTree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.pruneTree(TreeNode root) |
TreeNode |
Solution.pruneTree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
List<Integer> |
Solution.distanceK(TreeNode root,
TreeNode target,
int k) |
List<Integer> |
Solution.distanceK(TreeNode root,
TreeNode target,
int k) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.subtreeWithAllDeepest(TreeNode root) |
TreeNode |
Solution.subtreeWithAllDeepest(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.subtreeWithAllDeepest(TreeNode root) |
TreeNode |
Solution.subtreeWithAllDeepest(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.leafSimilar(TreeNode root1,
TreeNode root2) |
boolean |
Solution.leafSimilar(TreeNode root1,
TreeNode root2) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.constructFromPrePost(int[] preorder,
int[] postorder) |
TreeNode |
Solution.constructFromPrePost(int[] preorder,
int[] postorder) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.increasingBST(TreeNode root) |
TreeNode |
Solution.increasingBST(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.increasingBST(TreeNode root) |
TreeNode |
Solution.increasingBST(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
CBTInserter.getRoot() |
TreeNode |
CBTInserter.getRoot() |
Constructor and Description |
---|
CBTInserter(TreeNode root) |
CBTInserter(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.rangeSumBST(TreeNode root,
int low,
int high) |
int |
Solution.rangeSumBST(TreeNode root,
int low,
int high) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.flipEquiv(TreeNode root1,
TreeNode root2) |
boolean |
Solution.flipEquiv(TreeNode root1,
TreeNode root2) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.isCompleteTree(TreeNode root) |
boolean |
Solution.isCompleteTree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.isUnivalTree(TreeNode root) |
boolean |
Solution.isUnivalTree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.minCameraCover(TreeNode root) |
int |
Solution.minCameraCover(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
List<Integer> |
Solution.flipMatchVoyage(TreeNode root,
int[] voyage) |
List<Integer> |
Solution.flipMatchVoyage(TreeNode root,
int[] voyage) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.distributeCoins(TreeNode root) |
int |
Solution.distributeCoins(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
List<List<Integer>> |
Solution.verticalTraversal(TreeNode root) |
List<List<Integer>> |
Solution.verticalTraversal(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
String |
Solution.smallestFromLeaf(TreeNode root) |
String |
Solution.smallestFromLeaf(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.isCousins(TreeNode root,
int x,
int y) |
boolean |
Solution.isCousins(TreeNode root,
int x,
int y) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.insertIntoMaxTree(TreeNode root,
int val) |
TreeNode |
Solution.insertIntoMaxTree(TreeNode root,
int val) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.insertIntoMaxTree(TreeNode root,
int val) |
TreeNode |
Solution.insertIntoMaxTree(TreeNode root,
int val) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.bstFromPreorder(int[] preorder) |
TreeNode |
Solution.bstFromPreorder(int[] preorder) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.sumRootToLeaf(TreeNode root) |
int |
Solution.sumRootToLeaf(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.maxAncestorDiff(TreeNode root) |
int |
Solution.maxAncestorDiff(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.recoverFromPreorder(String traversal) |
TreeNode |
Solution.recoverFromPreorder(String traversal) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.bstToGst(TreeNode root) |
TreeNode |
Solution.bstToGst(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.bstToGst(TreeNode root) |
TreeNode |
Solution.bstToGst(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.sufficientSubset(TreeNode root,
int limit) |
TreeNode |
Solution.sufficientSubset(TreeNode root,
int limit) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.sufficientSubset(TreeNode root,
int limit) |
TreeNode |
Solution.sufficientSubset(TreeNode root,
int limit) |
int |
Solution.sufficientSubset(TreeNode root,
int limit,
int sum,
boolean isLeaf) |
int |
Solution.sufficientSubset(TreeNode root,
int limit,
int sum,
boolean isLeaf) |
Modifier and Type | Method and Description |
---|---|
List<TreeNode> |
Solution.delNodes(TreeNode root,
int[] localToDelete) |
List<TreeNode> |
Solution.delNodes(TreeNode root,
int[] localToDelete) |
Modifier and Type | Method and Description |
---|---|
List<TreeNode> |
Solution.delNodes(TreeNode root,
int[] localToDelete) |
List<TreeNode> |
Solution.delNodes(TreeNode root,
int[] localToDelete) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.lcaDeepestLeaves(TreeNode root) |
TreeNode |
Solution.lcaDeepestLeaves(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.getDep(TreeNode root) |
int |
Solution.getDep(TreeNode root) |
TreeNode |
Solution.lcaDeepestLeaves(TreeNode root) |
TreeNode |
Solution.lcaDeepestLeaves(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.btreeGameWinningMove(TreeNode root,
int n,
int x) |
boolean |
Solution.btreeGameWinningMove(TreeNode root,
int n,
int x) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.maxLevelSum(TreeNode root) |
int |
Solution.maxLevelSum(TreeNode root) |
Constructor and Description |
---|
FindElements(TreeNode root) |
FindElements(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.deepestLeavesSum(TreeNode root) |
int |
Solution.deepestLeavesSum(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
List<Integer> |
Solution.getAllElements(TreeNode root1,
TreeNode root2) |
List<Integer> |
Solution.getAllElements(TreeNode root1,
TreeNode root2) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.sumEvenGrandparent(TreeNode root) |
int |
Solution.sumEvenGrandparent(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.removeLeafNodes(TreeNode root,
int target) |
TreeNode |
Solution.removeLeafNodes(TreeNode root,
int target) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.removeLeafNodes(TreeNode root,
int target) |
TreeNode |
Solution.removeLeafNodes(TreeNode root,
int target) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.maxProduct(TreeNode root) |
int |
Solution.maxProduct(TreeNode root) |
int |
Solution.sumTree(TreeNode node) |
int |
Solution.sumTree(TreeNode node) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.isSubPath(ListNode head,
TreeNode root) |
boolean |
Solution.isSubPath(ListNode head,
TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.longestZigZag(TreeNode root) |
int |
Solution.longestZigZag(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.maxSumBST(TreeNode root) |
int |
Solution.maxSumBST(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.getTargetCopy(TreeNode original,
TreeNode cloned,
TreeNode target) |
TreeNode |
Solution.getTargetCopy(TreeNode original,
TreeNode cloned,
TreeNode target) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.getTargetCopy(TreeNode original,
TreeNode cloned,
TreeNode target) |
TreeNode |
Solution.getTargetCopy(TreeNode original,
TreeNode cloned,
TreeNode target) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.balanceBST(TreeNode root) |
TreeNode |
Solution.balanceBST(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.balanceBST(TreeNode root) |
TreeNode |
Solution.balanceBST(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.goodNodes(TreeNode root) |
int |
Solution.goodNodes(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.pseudoPalindromicPaths(TreeNode root) |
int |
Solution.pseudoPalindromicPaths(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.countPairs(TreeNode root,
int distance) |
int |
Solution.countPairs(TreeNode root,
int distance) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.isEvenOddTree(TreeNode root) |
boolean |
Solution.isEvenOddTree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.canMerge(List<TreeNode> trees) |
TreeNode |
Solution.canMerge(List<TreeNode> trees) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.canMerge(List<TreeNode> trees) |
TreeNode |
Solution.canMerge(List<TreeNode> trees) |
Modifier and Type | Method and Description |
---|---|
String |
Solution.getDirections(TreeNode root,
int startValue,
int destValue) |
String |
Solution.getDirections(TreeNode root,
int startValue,
int destValue) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.createBinaryTree(int[][] descriptions) |
TreeNode |
Solution.createBinaryTree(int[][] descriptions) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.checkTree(TreeNode root) |
boolean |
Solution.checkTree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.averageOfSubtree(TreeNode root) |
int |
Solution.averageOfSubtree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.evaluateTree(TreeNode root) |
boolean |
Solution.evaluateTree(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.amountOfTime(TreeNode root,
int start) |
int |
Solution.amountOfTime(TreeNode root,
int start) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.reverseOddLevels(TreeNode root) |
TreeNode |
Solution.reverseOddLevels(TreeNode root) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.reverseOddLevels(TreeNode root) |
TreeNode |
Solution.reverseOddLevels(TreeNode root) |
Copyright © 2022. All rights reserved.