Package adt.tree

Examples of adt.tree.TreeNode

14
15
16
17
18
19
20
21
22
import adt.tree.TreeNode;

public class Q020_Root_to_leaf_path_sum_equal_to_a_given_number {

  public static void main(String[] args) {
    TreeNode root = Tree.bst2();
    boolean res = pathSum(root, 50);
    System.out.println(res);
  }
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
33
import adt.tree.TreeNode;

public class Q069_Find_next_right_node_of_a_given_key {

  public static void main(String[] args) {
    TreeNode root = Tree.bst1();
    TreeNode node = getNextRight(root, 8);
    if (node != null) {
      System.out.format("%d\n", node.val);
    } else {
      System.out.println("NULL");
    }
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
51
52
53
   
    Queue<TreeNode> queue = new LinkedList<TreeNode>();
    queue.add(root);
    queue.add(null);
   
    TreeNode prev = null;
   
    while (!queue.isEmpty()) {
      TreeNode node = queue.poll();
     
      if (node != null) {
        if (node.val == key) {
          return prev;
        }
View Full Code Here
56
57
58
59
60
61
62
63
64
public class Q043_Binary_Tree_to_Binary_Search_Tree_Conversion {
 
  static int index;
 
  public static void main(String[] args) {
    TreeNode root = Tree.tree3();
    binaryTreeToBST(root);
    root.print();
  }
View Full Code Here
27
28
29
30
31
32
33
34
35
import adt.tree.TreeNode;

public class Q076_Find_the_maximum_path_sum_between_two_leaves_of_a_binary_tree {

  public static void main(String[] args) {
    TreeNode root = Tree.tree17();
    maxPathSum(root);
    System.out.println(max);
  }
View Full Code Here
32
33
34
35
36
37
38
39
40
import adt.tree.TreeNode;

public class Q057_Remove_BST_keys_outside_the_given_range {

  public static void main(String[] args) {
    TreeNode root = Tree.tree9();
    root = removeOutsideRange(root, -10, 13);
    root.print();
  }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
    // base case
    if (root == null) {
      return null;
    }
   
    TreeNode left = removeOutsideRange(root.left, min, max);
    TreeNode right = removeOutsideRange(root.right, min, max);
   
    if (root.val < min) {
      return right;
    }
   
View Full Code Here
17
18
19
20
21
22
23
24
25
26
27
28
29
30
import adt.tree.TreeNode;

public class Q026_Inorder_Successor_in_Binary_Search_Tree {

  public static void main(String[] args) {
    TreeNode root = Tree.bst2();
    TreeNode node = Tree.getTreeNode(root, 8);
   
    TreeNode successor = inOrderSuccessor(root, node);
    if (successor == null) {
      System.out.println("null");
    } else {
      System.out.println(successor.val);
    }
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
      return minNode(node.right);
    }
   
    // 否则从 root 开始找一直到找到 node 为止
    // 在找的过程中，如果 root 的值比 node 大，那么记录下它
    TreeNode succ = null;
   
    while (root != null) {
      if (root.val > node.val) {
        succ = root;
        root = root.left;
View Full Code Here
28
29
30
31
32
33
34
35
import adt.tree.TreeNode;

public class Q007_Print_out_all_of_its_root_to_leaf_paths_one_per_line {

  public static void main(String[] args) {
    TreeNode root = Tree.tree1();
    printPath(root, new ArrayList<Integer>());
  }
View Full Code Here
TOP

Related Classes of adt.tree.TreeNode

  • adt.tree.Tree
  • problems.geeks.linkedlist.Q026A_Sorted_Linked_List_to_Balanced_BST
  • problems.geeks.linkedlist.Q026B_Sorted_Linked_List_to_Balanced_BST
  • problems.geeks.tree.Q001_Tree_Traversals
  • problems.geeks.tree.Q002_Calculate_Size_of_a_tree
  • problems.geeks.tree.Q003_Determine_if_Two_Trees_are_Identical
  • problems.geeks.tree.Q004_Find_the_Maximum_Depth_or_Height_of_a_Tree
  • problems.geeks.tree.Q005_Delete_a_Tree
  • problems.geeks.tree.Q006_Convert_a_Binary_Tree_into_its_Mirror_Tree
  • problems.geeks.tree.Q007_Print_out_all_of_its_root_to_leaf_paths_one_per_line
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.